The decision problem for the optimal objective value (and unboundedness) of a k-level linear program is Σ^p_{k-1}-complete.
The computational complexity of multi-level linear programs
2 Pith papers cite this work, alongside 44 external citations. Polarity classification is still indexing.
2
Pith papers citing it
44
external citations · OpenAlex
fields
math.OC 2years
2026 2representative citing papers
Develops an exact finite-convergence algorithm for Σ₂^p-hard mixed-integer bilevel stochastic programs via extended single-level reformulation and stochastic cutting planes.
citing papers explorer
-
Decision Problems in Multilevel Linear Programming
The decision problem for the optimal objective value (and unboundedness) of a k-level linear program is Σ^p_{k-1}-complete.
-
An Exact Algorithm for Mixed-Integer Bilevel Stochastic Problem
Develops an exact finite-convergence algorithm for Σ₂^p-hard mixed-integer bilevel stochastic programs via extended single-level reformulation and stochastic cutting planes.