On parallelizing dual decomposition in stochastic integer programming

Miles Lubin*, Kipp Martin, Cosmin G. Petra, Burhaneddin Sandikçi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

47 Citations (Scopus)

Abstract

For stochastic mixed-integer programs, we revisit the dual decomposition algorithm of Carøe and Schultz from a computational perspective with the aim of its parallelization. We address an important bottleneck of parallel execution by identifying a formulation that permits the parallel solution of the master program by using structure-exploiting interior-point solvers. Our results demonstrate the potential for parallel speedup and the importance of regularization (stabilization) in the dual optimization. Load imbalance is identified as a remaining barrier to parallel scalability.

Original languageEnglish
Pages (from-to)252-258
Number of pages7
JournalOperations Research Letters
Volume41
Issue number3
DOIs
Publication statusPublished - May 2013
Externally publishedYes

Keywords

  • Bundle methods
  • Column generation
  • Dual decomposition
  • Mixed-integer programming
  • Parallel computing
  • Stochastic programming

Fingerprint

Dive into the research topics of 'On parallelizing dual decomposition in stochastic integer programming'. Together they form a unique fingerprint.

Cite this