The decision problem for the optimal objective value (and unboundedness) of a k-level linear program is Σ^p_{k-1}-complete.
Integer pro- gramming games
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2representative citing papers
k-level LP feasibility is Σ^p_{k-1}-complete for k≥2, polynomial for k≤4 without coupling and unbounded variables but Σ^p_{k-1}-complete for k≥5; optimal value is FΔ^p_k-complete for k≥2 even without coupling.
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.
-
Price of Coupling in Multilevel Linear Programming
k-level LP feasibility is Σ^p_{k-1}-complete for k≥2, polynomial for k≤4 without coupling and unbounded variables but Σ^p_{k-1}-complete for k≥5; optimal value is FΔ^p_k-complete for k≥2 even without coupling.