A Survey and Comparison of Optimization Methods for Solving Multi-Stage Stochastic Programs with Recourse

A Survey and Comparison of Optimization Methods for Solving Multi-Stage Stochastic Programs with Recourse

Enzo Sauma
Copyright: © 2013 |Pages: 14
DOI: 10.4018/joris.2013040102
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In the last decade, multi-stage stochastic programs with recourse have been broadly used to model real-world applications. This paper reviews the main optimization methods that are used to solve multi-stage stochastic programs with recourse. In particular, this paper reviews four types of optimization approaches to solve multi-stage stochastic programs with recourse: direct methods, decomposition methods, Lagrangian methods and empirical-distribution methods. All these methods require some form of approximation, since multi-stage stochastic programs involve the evaluation of random functions and their expectations. The authors also provides a classification of the considered optimization methods. While decomposition optimization methods are recommendable for large linear problems, Lagrangian optimization methods are appropriate for highly nonlinear problems. When the problem is both highly nonlinear and very large, an empirical-distribution method may be the best alternative.
Article Preview
Top

Multi-Stage Stochastic Program With Recourse

To understand the multi-stage stochastic program with recourse, we begin by presenting an easier version of this model: the two-stage stochastic linear program with recourse.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024): Forthcoming, Available for Pre-Order
Volume 14: 1 Issue (2023)
Volume 13: 2 Issues (2022)
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing