Complexity of bilevel linear programming with a single upper-level variable

DOI10.1007/978-3-032-28691-8_28MaRDI QIDQ7349472zbMATH OpenFDO

Authors Nagisa Sugishita, Margarida Carvalho

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_28

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• Asymmetry in the complexity of the multi-commodity network pricing problem
• Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
• Checking local optimality in constrained quadratic programming is NP- hard
• Computational Difficulties of Bilevel Linear Programming
• Descent approaches for quadratic bilevel programming
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1163110 (Why is no real title available?)
• scientific article; zbMATH DE number 2246593 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Mixed-integer bilevel representability
• New Branch-and-Bound Rules for Linear Bilevel Programming
• On coupling constraints in linear bilevel optimization
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
• The polynomial hierarchy and a simple model for competitive analysis

This page was built for publication: Complexity of bilevel linear programming with a single upper-level variable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349472)