On coupling constraints in linear bilevel optimization
From MaRDI portal
Cites work
- Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
- Bilevel optimization. Advances and next challenges
- Computational Difficulties of Bilevel Linear Programming
- Descent approaches for quadratic bilevel programming
- Discrete linear bilevel programming problem
- Exact augmented Lagrangian duality for mixed integer linear programming
- Exact augmented Lagrangian duality for mixed integer quadratic programming
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2246593 (Why is no real title available?)
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Links between linear bilevel and mixed 0-1 programming problems
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On the structure and properties of a linear multilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- The polynomial hierarchy and a simple model for competitive analysis
Cited in
(5)- Scatter search with path relinking for linear bilevel problems
- On coupling constraints in pessimistic linear bilevel optimization
- A solution approach to the multi-level linear fractional programming problems
- On strong duality based reformulations for a class of bilevel linear programs
- Complexity of bilevel linear programming with a single upper-level variable
This page was built for publication: On coupling constraints in linear bilevel optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968746)
