Computational Management Science

, Volume 8, Issue 4, pp 355–370 | Cite as

Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems

  • Jean-Paul Watson
  • David L. WoodruffEmail author
Open Access
Original Paper


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.


Decision Variable Solution Quality Stochastic Program Extensive Form Integer Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Open Access

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.


  1. Birge JR, Louveaux F (1997) Introduction to stochastic programming. Springer, BerlinGoogle Scholar
  2. Fan Y, Liu C (2010) Solving stochastic transportation network protection problem using the progressive hedging-based method. Netw Spatial Econ 10(2): 193–208CrossRefGoogle Scholar
  3. Fourer R, Gay DM, Kernighan BW (2003) AMPL: a modeling language for mathematical programming, 2nd edn. Thompson Learning, Brooks/ColeGoogle Scholar
  4. Garille SG, Gass SI (2001) Stigler’s diet problem revisited. Opera Res 49(1): 1–13CrossRefGoogle Scholar
  5. (2009) Special issue on computational optimization under uncertainty. Comput Manag Sci 6(2): 115–267CrossRefGoogle Scholar
  6. Kall P, Wallace SW (1994) Stochastic programming. Wiley, ChichesterGoogle Scholar
  7. Listes O, Dekker R (2005) A scenario aggregation based approach for determining a robust airline fleet composition. Transp Sci 39: 367–382CrossRefGoogle Scholar
  8. Løkketangen A, Woodruff DL (1996) Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming. J Heurist 2: 111–128CrossRefGoogle Scholar
  9. Mulvey JM, Vladimirou H (1991) Applying the progressive hedging algorithm to stochastic generalized networks. Ann Oper Res 31: 399–424CrossRefGoogle Scholar
  10. Parija GR, Ahmed S, King AJ (2004) On bridging the gap between stochastic integer programming and MIP solver technologies. INFORMS J Comput 16: 73–83CrossRefGoogle Scholar
  11. Rockafellar RT, Wets RJ-B (1991) Scenarios and policy aggregation in optimization under uncertainty. Math Oper Res 16: 119–147CrossRefGoogle Scholar
  12. Ruszczyński A (2002) Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra. Math Program 93: 195–215CrossRefGoogle Scholar
  13. van der Vlerk MH (1996–2009) Stochastic integer programming bibliography.
  14. Wallace, SW, Ziemba, WT (eds) (2005) Applications of stochastic programming, SIAM. Cambridge University Press, CambridgeGoogle Scholar
  15. 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
  16. Woodruff DL, Zemel E (1993) Hashing vectors for tabu search. Ann Oper Res 41: 123–137CrossRefGoogle Scholar

Copyright information

© The Author(s) 2010

Authors and Affiliations

  1. 1.Discrete Math and Complex Systems DepartmentSandia National LaboratoriesAlbuquerqueUSA
  2. 2.Graduate School of ManagementUniversity of CaliforniaDavisUSA

Personalised recommendations