Robust bilevel optimization for near-optimal lower-level solutions
From MaRDI portal
Publication:6635807
bilevel optimizationdualityrobust optimizationbounded rationalityextended formulationbilinear constraintsdecision-dependent uncertainty
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34) Hierarchical games (including Stackelberg games) (91A65)
Recommendations
- Uncertainty handling in bilevel optimization for robust and reliable solutions
- Complexity of near-optimal robust versions of multilevel optimization problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Foundations of bilevel programming
- Bilevel derivative-free optimization and its application to robust optimization
Cites work
- scientific article; zbMATH DE number 4128662 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1163108 (Why is no real title available?)
- scientific article; zbMATH DE number 1163109 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set
- A class of stochastic programs with decision dependent uncertainty
- A robust approach for modeling limited observability in bilevel optimization
- A survey on bilevel optimization under uncertainty
- An SOS1-based approach for solving MPECs with a natural gas market application
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Complexity of near-optimal robust versions of multilevel optimization problems
- Computing feasible points for binary MINLPs with MPECs
- Computing locally optimal solutions of the Bilevel Optimization problem using the KKT approach
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
- Decision rule bounds for two-stage stochastic bilevel programs
- Disjunctive cuts for continuous linear bilevel programming
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Foundations of bilevel programming
- Generalized semi-infinite programming: Theory and methods
- JuMP: a modeling language for mathematical optimization
- Julia: a fresh approach to numerical computing
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Methods for Global Concave Minimization: A Bibliographic Survey
- On a class of bilevel linear mixed-integer programs in adversarial settings
- On bilevel optimization with inexact follower
- On mathematical programming with indicator constraints
- On the complexity of robust bilevel optimization with uncertain follower's objective
- Pessimistic bilevel optimization
- Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints
- Recent advances in robust optimization: an overview
- Robust Wardrop Equilibrium
- Robust game theory
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel optimization
- The Benders decomposition algorithm: a literature review
- Weak via strong Stackelberg problem: New results
This page was built for publication: Robust bilevel optimization for near-optimal lower-level solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635807)
