Stability, Approximation, and Decomposition in Two- And Multistage Stochastic Programming 2009
DOI: 10.1007/978-3-8348-9399-4_3
|View full text |Cite
|
Sign up to set email alerts
|

Recombining Trees for Multistage Stochastic Programs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…This requires some approximations in the state variables, yet it has been shown that similar approaches provide consistent approximations to the full stochastic model (cf. Vigerske 2007 andEpe et al 2010). In order to adequately describe the stochastics of wind and solar photovoltaic, a combination of three infeed scenarios in the range of low to high feed-in is used.…”
Section: Discussionmentioning
confidence: 99%
“…This requires some approximations in the state variables, yet it has been shown that similar approaches provide consistent approximations to the full stochastic model (cf. Vigerske 2007 andEpe et al 2010). In order to adequately describe the stochastics of wind and solar photovoltaic, a combination of three infeed scenarios in the range of low to high feed-in is used.…”
Section: Discussionmentioning
confidence: 99%
“…Here, it is essential to remember the crucial assumption: the inflow uncertainty must be stagewise independent, that is, ξHrt and ξRrt are independent of the history ξHr,t-1 and ξRr,t-1 of the process. Under this assumption, the scenario tree collapses to a so-called recombining scenario tree [31], which means that in all nodes related to month t, the same realizations ξHrt and ξRrt may occur. As a result, for each month t, there is only one FCF that does not depend on the random data.…”
Section: Solving the Ltgs Problem In Sddpmentioning
confidence: 99%