Robust bilevel optimization for near-optimal lower-level solutions
DOI10.1007/s10898-024-01422-zMaRDI QIDQ6635807
Miguel F. Anjos, Mathieu Besançon, Luce Brotcorne
Publication date: 12 November 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
dualityrobust optimizationbounded rationalitybilevel optimizationextended formulationbilinear constraintsdecision-dependent uncertainty
Nonconvex programming, global optimization (90C26) Hierarchical games (including Stackelberg games) (91A65) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An SOS1-based approach for solving MPECs with a natural gas market application
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- Foundations of bilevel programming
- Computing feasible points for binary MINLPs with MPECs
- The Benders decomposition algorithm: a literature review
- On a class of bilevel linear mixed-integer programs in adversarial settings
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Generalized semi-infinite programming: Theory and methods
- Weak via strong Stackelberg problem: New results
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- On the complexity of robust bilevel optimization with uncertain follower's objective
- A robust approach for modeling limited observability in bilevel optimization
- Computing locally optimal solutions of the Bilevel Optimization problem using the KKT approach
- Complexity of near-optimal robust versions of multilevel optimization problems
- Recent advances in robust optimization: an overview
- On mathematical programming with indicator constraints
- Disjunctive cuts for continuous linear bilevel programming
- Robust game theory
- A class of stochastic programs with decision dependent uncertainty
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Julia: A Fresh Approach to Numerical Computing
- Robust Wardrop Equilibrium
- Methods for Global Concave Minimization: A Bibliographic Survey
- Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- On Bilevel Optimization with Inexact Follower
- Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
- Bilevel Programming Problems
- Pessimistic Bilevel Optimization
- JuMP: A Modeling Language for Mathematical Optimization
- A survey on bilevel optimization under uncertainty
This page was built for publication: Robust bilevel optimization for near-optimal lower-level solutions