Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Scenario Tree-Based Decomposition for Solving Multistage Stochastic ProgramsA Scenario Tree-Based Decomposition of Multistage Stochastic Mixed-Integer Problems

A Scenario Tree-Based Decomposition for Solving Multistage Stochastic Programs: A Scenario... [Based on our problem formulation of Section 3.2, we are interested in solving optimization problems where a set of parameters is uncertain. Modeling uncertainty via a set of scenarios and describing their relationship by the corresponding scenario tree, we obtain a multistage stochastic mixed-integer program (SMIP). As nonanticipativity constraints have to be respected, the deterministic problems associated with one scenario cannot be solved separately. Additionally, we want to consider problems where integer restrictions can appear in any stage of the problem, which may even make the solution of a one-scenario subproblem difficult. Furthermore, the size of problems normally grows very quickly with increasing number of time stages and scenarios considered in the model. In this chapter, we present a decomposition approach in order to solve the S-OPGen problem which shows the potential of solving a wide range of related problems.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Scenario Tree-Based Decomposition for Solving Multistage Stochastic ProgramsA Scenario Tree-Based Decomposition of Multistage Stochastic Mixed-Integer Problems

Download PDF
17 pages

Loading next page...
 
/lp/springer-journals/a-scenario-tree-based-decomposition-for-solving-multistage-stochastic-YeNMWtQ0As
Publisher
Vieweg+Teubner
Copyright
© Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 2011
ISBN
978-3-8348-1409-8
Pages
77 –94
DOI
10.1007/978-3-8348-9829-6_6
Publisher site
See Chapter on Publisher Site

Abstract

[Based on our problem formulation of Section 3.2, we are interested in solving optimization problems where a set of parameters is uncertain. Modeling uncertainty via a set of scenarios and describing their relationship by the corresponding scenario tree, we obtain a multistage stochastic mixed-integer program (SMIP). As nonanticipativity constraints have to be respected, the deterministic problems associated with one scenario cannot be solved separately. Additionally, we want to consider problems where integer restrictions can appear in any stage of the problem, which may even make the solution of a one-scenario subproblem difficult. Furthermore, the size of problems normally grows very quickly with increasing number of time stages and scenarios considered in the model. In this chapter, we present a decomposition approach in order to solve the S-OPGen problem which shows the potential of solving a wide range of related problems.]

Published: Jan 20, 2011

There are no references for this article.