• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Stability, Approximation, and Decomposition in Two- And Multistage Stochastic Programming

Stability, Approximation, and Decomposition in Two- And Multistage Stochastic Programming

Paperback

Series: Stochastic Programming

General MathematicsProbability & Statistics

ISBN10: 3834809217
ISBN13: 9783834809216
Publisher: Vieweg+teubner Verlag
Published: Sep 24 2009
Pages: 184
Weight: 0.50
Height: 0.40 Width: 5.83 Depth: 8.27
Language: English
Stochastic programming provides a framework for modelling, analyzing, and solving optimization problems with some parameters being not known up to a probability distribution. Such problems arise in a variety of applications, such as inventory control, financial planning and portfolio optimization, airline revenue management, scheduling and operation of power systems, and supply chain management.

Christian Küchler studies various aspects of the stability of stochastic optimization problems as well as approximation and decomposition methods in stochastic programming. In particular, the author presents an extension of the Nested Benders decomposition algorithm related to the concept of recombining scenario trees. The approach combines the concept of cut sharing with a specific aggregation procedure and prevents an exponentially growing number of subproblem evaluations. Convergence results and numerical properties are discussed.

Also in

Probability & Statistics