Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
- 2.4k Downloads
Numerous planning problems can be formulated as multi-stage stochastic programs and many possess key discrete (integer) decision variables in one or more of the stages. Progressive hedging (PH) is a scenario-based decomposition technique that can be leveraged to solve such problems. Originally devised for problems possessing only continuous variables, PH has been successfully applied as a heuristic to solve multi-stage stochastic programs with integer variables. However, a variety of critical issues arise in practice when implementing PH for the discrete case, especially in the context of very difficult or large-scale mixed-integer problems. Failure to address these issues properly results in either non-convergence of the heuristic or unacceptably long run-times. We investigate these issues and describe algorithmic innovations in the context of a broad class of scenario-based resource allocation problem in which decision variables represent resources available at a cost and constraints enforce the need for sufficient combinations of resources. The necessity and efficacy of our techniques is empirically assessed on a two-stage stochastic network flow problem with integer variables in both stages.
KeywordsDecision Variable Solution Quality Stochastic Program Extensive Form Integer Variable
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
- Birge JR, Louveaux F (1997) Introduction to stochastic programming. Springer, BerlinGoogle Scholar
- Fourer R, Gay DM, Kernighan BW (2003) AMPL: a modeling language for mathematical programming, 2nd edn. Thompson Learning, Brooks/ColeGoogle Scholar
- Kall P, Wallace SW (1994) Stochastic programming. Wiley, ChichesterGoogle Scholar
- van der Vlerk MH (1996–2009) Stochastic integer programming bibliography. http://mally.eco.rug.nl/index.html?spbib.html
- Wallace, SW, Ziemba, WT (eds) (2005) Applications of stochastic programming, SIAM. Cambridge University Press, CambridgeGoogle Scholar
- Wets RJ-B (1989) The aggregation principle in scenario analysis and stochastic optimization. In: Wallace SW (eds) Algorithms and model formulations in mathematical programming. Springer, BerlinGoogle Scholar