Skip to main content
Article
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
Mathematical Programming, Series B
  • Dinakar Gade, Sabre Holdings
  • Gabriel Hackebeil, Texas A & M University - College Station
  • Sarah M. Ryan, Iowa State University
  • Jean-Paul Watson, Sandia National Laboratories
  • Roger J-B Wets, University of California - Davis
  • David L. Woodruff, University of California - Davis
Document Type
Article
Publication Version
Submitted Manuscript
Publication Date
5-1-2016
DOI
10.1007/s10107-016-1000-z
Abstract
We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. We report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.
Comments

This is a manuscript of an article from Mathematical Programming, Series B, 157 (2016): 47, doi: 10.1007/s10107-016-1000-z. The final publication is available at Springer via http://dx.doi.org/10.1007/s10107-016-1000-z.

Copyright Owner
Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society
Language
en
File Format
application/pdf
Citation Information
Dinakar Gade, Gabriel Hackebeil, Sarah M. Ryan, Jean-Paul Watson, et al.. "Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs" Mathematical Programming, Series B Vol. 157 Iss. 1 (2016) p. 47 - 67
Available at: http://works.bepress.com/sarah_m_ryan/31/