A Unified Framework for Multistage and Multilevel Mixed Integer Linear Optimization
arXiv:2104.09003 · doi:10.1007/978-3-030-52119-6
Abstract
We introduce a unified framework for the study of multilevel mixed integer linear optimization problems and multistage stochastic mixed integer linear optimization problems with recourse. The framework highlights the common mathematical structure of the two problems and allows for the development of a common algorithmic framework. Focusing on the two-stage case, we investigate, in particular, the nature of the value function of the second-stage problem, highlighting its connection to dual functions and the theory of duality for mixed integer linear optimization problems, and summarize different reformulations. We then present two main solution techniques, one based on a Benders-like decomposition to approximate either the risk function or the value function, and the other one based on cutting plane generation.
References in corpus (4)
Cited by in corpus (10)
- Bilevel methods for image reconstruction
- A Framework for Generalized Benders' Decomposition and Its Application to Multilevel Optimization
- Linearly convergent bilevel optimization with single-step inner methods
- Projection-Free Algorithm for Stochastic Bi-level Optimization
- A branch-and-cut algorithm for submodular interdiction games
- An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning
- SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
- Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
- Bilevel Learning with Inexact Stochastic Gradients