Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

Progressive hedging (PH), though an effective heuristic for stochastic MIPs, is not guaranteed convergence in the integer case. Here, we propose BBPH, a branch and bound algorithm that uses PH within each node that, given enough time, will always converge to the optimal solution. Interesting avenues of research emerge answering the questions of obtaining bounds in a reasonable amount of time, exploiting parallelism, and branching decisions.