Complexity of near-optimal robust versions of multilevel optimization problems
From MaRDI portal
Abstract: Near-optimality robustness extends multilevel optimization with a limited deviation of a lower level from its optimal solution, anticipated by higher levels. We analyze the complexity of near-optimal robust multilevel problems, where near-optimal robustness is modelled through additional adversarial decision-makers. Near-optimal robust versions of multilevel problems are shown to remain in the same complexity class as the problem without near-optimality robustness under general conditions.
Recommendations
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty
- scientific article; zbMATH DE number 895368
- Decision uncertainty in multiobjective optimization
- Complexity and in-approximability of a selection problem in robust optimization
Cites work
- A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A special three-level optimization problem
- A study on the computational complexity of the bilevel knapsack problem
- A survey on mixed-integer programming techniques in bilevel optimization
- A unified framework for multistage mixed integer linear optimization
- An enhanced branch-and-bound algorithm for bilevel integer linear programming
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Links between linear bilevel and mixed 0-1 programming problems
- NP-completeness of the linear complementarity problem
- On a class of bilevel linear mixed-integer programs in adversarial settings
- On bilevel optimization with inexact follower
- Pessimistic bilevel optimization
- Solution of bilevel optimization problems using the KKT approach
- Solving bilevel programs with the KKT-approach
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- The polynomial-time hierarchy
Cited in
(11)- Using neural networks to solve linear bilevel problems with unknown lower level
- On complexity of finding strong-weak solutions in bilevel linear programming
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- A survey on bilevel optimization under uncertainty
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective
- MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems
- A survey on mixed-integer programming techniques in bilevel optimization
- Complexity and in-approximability of a selection problem in robust optimization
- Shortest path network interdiction with asymmetric uncertainty
- Robust bilevel optimization for near-optimal lower-level solutions
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
This page was built for publication: Complexity of near-optimal robust versions of multilevel optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230787)
