A Framework for Generalized Benders' Decomposition and Its Application to Multilevel Optimization
arXiv:2104.06496 · doi:10.1007/s10107-021-01763-7
Abstract
We describe a framework for reformulating and solving optimization problems that generalizes the well-known framework originally introduced by Benders. We discuss details of the application of the procedures to several classes of optimization problems that fall under the umbrella of multilevel/multistage mixed integer linear optimization problems. The application of this abstract framework to this broad class of problems provides new insights and a broader interpretation of the core ideas, especially as they relate to duality and the value functions of optimization problems that arise in this context.
References in corpus (4)
- A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization
- A Branch-and-Cut Algorithm for Mixed Integer Bilevel Linear Optimization Problems and Its Implementation
- A parametric integer programming algorithm for bilevel mixed integer programs
- A Projection-Based Reformulation and Decomposition Algorithm for Global Optimization of a Class of Mixed Integer Bilevel Linear Programs