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 language | English |
---|---|
Pages (from-to) | 252-258 |
Number of pages | 7 |
Journal | Operations Research Letters |
Volume | 41 |
Issue number | 3 |
DOIs | |
Publication status | Published - May 2013 |
Externally published | Yes |
Keywords
- Bundle methods
- Column generation
- Dual decomposition
- Mixed-integer programming
- Parallel computing
- Stochastic programming