The decision problem for the optimal objective value (and unboundedness) of a k-level linear program is Σ^p_{k-1}-complete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
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.