Recombining Trees for Multistage Stochastic Programs

Christian Küchler

Chapter 3 in Stability, Approximation, and Decomposition in Two- and Multistage Stochastic Programming, 2009, pp 33-96 from Springer

Abstract: Zusammenfassung In order to solve multistage stochastic optimization problems by numerical methods, the underlying stochastic process is usually approximated by a process that takes only a finite number of values. Consequently, the approximating process can be represented by a scenario tree, where the nodes of the tree correspond to the possible realizations of the process and the tree structure is induced by the filtration generated by the process. Unfortunately, the number of nodes can grow exponentially as the number of time stages increases, and the corresponding optimization problem thus becomes quickly intractable. Hence, many problems of practical interest are represented by stochastic programming models that include only either a small number of time stages or a small number of scenarios.

Keywords: Stochastic Program; Scenario Tree; Time Stage; Thermal Unit; Forward Mode (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-8348-9399-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9783834893994

DOI: 10.1007/978-3-8348-9399-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().