{"ID":2872648,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2509.08671","arxiv_id":"2509.08671","title":"Extracting Alternative Solutions from Benders Decomposition","abstract":"We show how to extract alternative solutions for optimization problems solved by Benders Decomposition. In practice, alternative solutions provide useful insights for complex applications; some solvers do support generation of alternative solutions but none appear to support such generation when using Benders Decomposition. We propose a new post-processing method that extracts multiple optimal and near-optimal solutions using the cut-pool generated during Benders Decomposition. Further, we provide a geometric framework for understanding how the adaptive approximation in Benders Decomposition relates to alternative solutions. We demonstrate this technique on stochastic programming and interdiction modeling, and we highlight use cases that require the ability to enumerate all optimal solutions.","short_abstract":"We show how to extract alternative solutions for optimization problems solved by Benders Decomposition. In practice, alternative solutions provide useful insights for complex applications; some solvers do support generation of alternative solutions but none appear to support such generation when using Benders Decomposi...","url_abs":"https://arxiv.org/abs/2509.08671","url_pdf":"https://arxiv.org/pdf/2509.08671v2","authors":"[\"Matthew Viens\",\"William E. Hart\",\"Michael Ferris\"]","published":"2025-09-10T15:06:43Z","proceeding":"math.OC","tasks":"[\"math.OC\"]","methods":"[]","has_code":false}