DOE OSTI · 1340699
BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs
Abstract
Progressive hedging, though an effective heuristic for solving stochastic mixed integer programs (SMIPs), is not guaranteed to converge in this case. Here, we describe BBPH, a branch and bound algorithm that uses PH at each node in the search tree such that, given sufficient time, it will always converge to a globally optimal solution. Additionally, to providing a theoretically convergent “wrapper” for PH applied to SMIPs, computational results demonstrate that for some difficult problem instances branch and bound can find improved solutions after exploring only a few nodes.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Barnett, Jason, Watson, Jean -Paul, Woodruff, David L.. 2016-11-27. BBPH: Using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs. https://doi.org/10.1016/j.orl.2016.11.006
Cite the original work for its findings. Save a collection to share your selection of sources.