The computational complexity of multi-level linear programs
From MaRDI portal
Publication:1184517
DOI10.1007/BF02098170zbMath0751.90046MaRDI QIDQ1184517
Publication date: 28 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Hierarchical games (including Stackelberg games) (91A65) Linear programming (90C05) Hierarchical systems (93A13)
Related Items (19)
Complexity of the multilevel critical node problem ⋮ Bilevel and multilevel programming: A bibliography review ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Earth-based gravitational wave detection from pulsars ⋮ Links between linear bilevel and mixed 0-1 programming problems ⋮ Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers ⋮ On the Quasiconcave Multilevel Programming Problems ⋮ Adjustable robust optimization through multi-parametric programming ⋮ On the complexity of quantified linear systems ⋮ Unnamed Item ⋮ Multi-parametric global optimization approach for tri-level mixed-integer linear optimization problems ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ Computation of the optimal tolls on the traffic network ⋮ Model, solution concept, and \(K\)th-best algorithm for linear trilevel programming ⋮ Competitive location and pricing on a line with metric transportation costs ⋮ The joint location-transportation model based on grey bi-level programming for early post-earthquake relief ⋮ Tri-level mixed-binary linear programming: solution approaches and application in defending critical infrastructure ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A quasiconcave minimization method for solving linear two-level programs
Cites Work
This page was built for publication: The computational complexity of multi-level linear programs
