DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

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. In conclusion, 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.

Authors:
 [1];  [2];  [3];  [4];  [5];  [5]
  1. Sabre Holdings, Southlake, TX (United States)
  2. Texas A & M Univ., College Station, TX (United States)
  3. Iowa State Univ., Ames, IA (United States)
  4. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  5. Univ. of California, Davis, CA (United States)
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1310314
Report Number(s):
SAND-2013-9195J
Journal ID: ISSN 0025-5610; PII: 1000
Grant/Contract Number:  
AC04-94AL85000
Resource Type:
Accepted Manuscript
Journal Name:
Mathematical Programming
Additional Journal Information:
Journal Volume: 157; Journal Issue: 1; Journal ID: ISSN 0025-5610
Publisher:
Springer
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICS AND COMPUTING; stochastic mixed-integer programming; decomposition algorithms; lower bounding

Citation Formats

Gade, Dinakar, Hackebeil, Gabriel, Ryan, Sarah M., Watson, Jean -Paul, Wets, Roger J.-B., and Woodruff, David L. Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs. United States: N. p., 2016. Web. doi:10.1007/s10107-016-1000-z.
Gade, Dinakar, Hackebeil, Gabriel, Ryan, Sarah M., Watson, Jean -Paul, Wets, Roger J.-B., & Woodruff, David L. Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs. United States. https://doi.org/10.1007/s10107-016-1000-z
Gade, Dinakar, Hackebeil, Gabriel, Ryan, Sarah M., Watson, Jean -Paul, Wets, Roger J.-B., and Woodruff, David L. Sat . "Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs". United States. https://doi.org/10.1007/s10107-016-1000-z. https://www.osti.gov/servlets/purl/1310314.
@article{osti_1310314,
title = {Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs},
author = {Gade, Dinakar and Hackebeil, Gabriel and Ryan, Sarah M. and Watson, Jean -Paul and Wets, Roger J.-B. and Woodruff, David L.},
abstractNote = {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. In conclusion, 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.},
doi = {10.1007/s10107-016-1000-z},
journal = {Mathematical Programming},
number = 1,
volume = 157,
place = {United States},
year = {Sat Apr 02 00:00:00 EDT 2016},
month = {Sat Apr 02 00:00:00 EDT 2016}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Citation Metrics:
Cited by: 106 works
Citation information provided by
Web of Science

Save / Share:

Works referenced in this record:

A finite branch-and-bound algorithm for two-stage stochastic integer programs
journal, June 2004

  • Ahmed, Shabbir; Tawarmalani, Mohit; Sahinidis, Nikolaos V.
  • Mathematical Programming, Vol. 100, Issue 2
  • DOI: 10.1007/s10107-003-0475-6

Dual decomposition in stochastic integer programming
journal, February 1999


A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
journal, August 2006


Toward scalable stochastic unit commitment: Part 2: solver configuration and performance assessment
journal, April 2015


Stochastic Network Interdiction
journal, April 1998

  • Cormican, Kelly J.; Morton, David P.; Wood, R. Kevin
  • Operations Research, Vol. 46, Issue 2
  • DOI: 10.1287/opre.46.2.184

Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
journal, March 2014


Decomposition Principle for Linear Programs
journal, February 1960


A flexible power system operations simulation model for assessing wind integration
conference, July 2011

  • Ela, Erik; Milligan, Michael; O'Malley, Mark
  • 2011 IEEE Power & Energy Society General Meeting, 2011 IEEE Power and Energy Society General Meeting
  • DOI: 10.1109/PES.2011.6039033

Scenario Cluster Decomposition of the Lagrangian dual in two-stage stochastic mixed 0–1 optimization
journal, January 2013

  • Escudero, Laureano F.; Araceli Garín, M.; Pérez, Gloria
  • Computers & Operations Research, Vol. 40, Issue 1
  • DOI: 10.1016/j.cor.2012.07.009

Lagrangean decomposition: A model yielding stronger lagrangean bounds
journal, June 1987

  • Guignard, Monique; Kim, Siwhan
  • Mathematical Programming, Vol. 39, Issue 2
  • DOI: 10.1007/BF02592954

Integration of progressive hedging and dual decomposition in stochastic integer programs
journal, May 2015


Pyomo: modeling and solving mathematical programs in Python
journal, August 2011

  • Hart, William E.; Watson, Jean-Paul; Woodruff, David L.
  • Mathematical Programming Computation, Vol. 3, Issue 3
  • DOI: 10.1007/s12532-011-0026-8

A decomposition algorithm applied to planning the interdiction of stochastic networks
journal, June 2005

  • Held, Harald; Hemmecke, Raymond; Woodruff, David L.
  • Naval Research Logistics, Vol. 52, Issue 4
  • DOI: 10.1002/nav.20079

Reformulation and sampling to solve a stochastic network interdiction problem
journal, October 2008

  • Janjarassuk, Udom; Linderoth, Jeff
  • Networks, Vol. 52, Issue 3
  • DOI: 10.1002/net.20237

Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
journal, January 1996

  • L�kketangen, Arne; Woodruff, DavidL.
  • Journal of Heuristics, Vol. 2, Issue 2
  • DOI: 10.1007/BF00247208

On parallelizing dual decomposition in stochastic integer programming
journal, May 2013


On the existence of optimal solutions to integer and mixed-integer programming problems
journal, December 1974


Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem
journal, November 2013

  • Morales-Espana, ; Latorre, Jesus M.; Ramos, Andres
  • IEEE Transactions on Power Systems, Vol. 28, Issue 4
  • DOI: 10.1109/TPWRS.2013.2251373

Applying the progressive hedging algorithm to stochastic generalized networks
journal, December 1991

  • Mulvey, John M.; Vladimirou, Hercules
  • Annals of Operations Research, Vol. 31, Issue 1
  • DOI: 10.1007/BF02204860

Solving multistage stochastic networks: An application of scenario aggregation
journal, October 1991


The Million-Variable “March” for Stochastic Combinatorial Optimization
journal, July 2005


Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
journal, June 2013


Scenarios and Policy Aggregation in Optimization Under Uncertainty
journal, February 1991

  • Rockafellar, R. T.; Wets, Roger J. -B.
  • Mathematics of Operations Research, Vol. 16, Issue 1
  • DOI: 10.1287/moor.16.1.119

Uncertainty Management in the Unit Commitment Problem
journal, May 2009


Toward scalable, parallel progressive hedging for stochastic unit commitment
conference, January 2013

  • Ryan, Sarah M.; Wets, Roger J. -B; Woodruff, David L.
  • 2013 IEEE Power & Energy Society General Meeting
  • DOI: 10.1109/PESMG.2013.6673013

A stochastic programming approach for supply chain network design under uncertainty
journal, November 2005

  • Santoso, Tjendera; Ahmed, Shabbir; Goetschalckx, Marc
  • European Journal of Operational Research, Vol. 167, Issue 1
  • DOI: 10.1016/j.ejor.2004.01.046

Dynamic Testing of Wholesale Power Market Designs: An Open-Source Agent-Based Framework
journal, August 2007


A stochastic model for the unit commitment problem
journal, January 1996

  • Takriti, S.; Birge, J. R.; Long, E.
  • IEEE Transactions on Power Systems, Vol. 11, Issue 3
  • DOI: 10.1109/59.535691

PySP: modeling and solving stochastic programs in Python
journal, March 2012

  • Watson, Jean-Paul; Woodruff, David L.; Hart, William E.
  • Mathematical Programming Computation, Vol. 4, Issue 2
  • DOI: 10.1007/s12532-012-0036-1

Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
journal, July 2010


Tight and compact MILP formulation for the thermal unit commitment problem
conference, July 2015

  • Morales-Espana, German; Latorre, Jesus; Ramos, Andres
  • 2015 IEEE Power & Energy Society General Meeting
  • DOI: 10.1109/pesgm.2015.7285639

Integer and Combinatorial Optimization
journal, September 1989

  • Connolly, David
  • Bulletin of the London Mathematical Society, Vol. 21, Issue 5
  • DOI: 10.1112/blms/21.5.499

The million-variable "march" for stochastic combinatorial optimization
text, January 2004

  • Ntaimo, Lewis; Sen, Suvrajeet
  • Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik
  • DOI: 10.18452/8311

A branch-and-price algorithm for multi-stage stochastic integer programming with application to stochastic batch-sizing problems
text, January 2002

  • Lulli, Guglielmo; Sen, Suvrajeet
  • Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik
  • DOI: 10.18452/2913

Integer and Combinatorial Optimization
journal, February 1990

  • Williams, H. P.; Nemhauser, George L.; Wolsey, Laurence A.
  • The Journal of the Operational Research Society, Vol. 41, Issue 2
  • DOI: 10.2307/2583737

Works referencing / citing this record:

Stochastic dual dynamic integer programming
journal, March 2018


A Progressive Hedging based branch-and-bound algorithm for mixed-integer stochastic programs
journal, June 2018


Progressive hedging for stochastic programs with cross-scenario inequality constraints
journal, November 2019


Optimising data-driven network under limited resource: a partial diversification approach
journal, August 2018


Combining penalty-based and Gauss-Seidel methods for solving stochastic mixed-integer problems
journal, March 2018

  • Oliveira, F.; Christiansen, J.; Dandurand, B.
  • International Transactions in Operational Research, Vol. 27, Issue 1
  • DOI: 10.1111/itor.12525

Modeling and Solution Techniques Used for Hydro Generation Scheduling
journal, July 2019

  • Parvez, Iram; Shen, JianJian; Khan, Mehran
  • Water, Vol. 11, Issue 7
  • DOI: 10.3390/w11071392