DagSemProc.05031.28.pdf
- Filesize: 38 kB
- 3 pages
Document
Subtree decomposition for multistage stochastic programs
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5031
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2005-05-27
Cite As Get BibTex
Shane Dye. Subtree decomposition for multistage stochastic programs. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.05031.28
Abstract
A class of algorithms for solving multistage stochastic recourse problems is described. The scenario tree is decomposed using a covering collection of subtrees. The approach is illustrated with two examples: adapting the diagonal quadratic approximation algorithm and adapting nested Bender's decomposition. The approach leads to a class of methods based on the subtree cover chosen (including the original implementation of the algorithm adapted). This approach increases flexibility in the size, number and structure of subproblems for multistage stochastic programming decomposition methods.
Subject Classification
Keywords
- Stochastic programming
- scenario tree
- decomposition
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads