Computational Difficulties of Bilevel Linear Programming
From MaRDI portal
Publication:3491308
DOI10.1287/opre.38.3.556zbMath0708.90052MaRDI QIDQ3491308
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2142/29015
heuristics; NP-hard; bilevel linear programming; grid search algorithm; parametric complementary pivot algorithm
65K05: Numerical mathematical programming methods
90C60: Abstract computational complexity for mathematical programming problems
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
On bilevel fractional programming, Hierarchical optimization: A satisfactory solution, Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms, Solving a bilevel linear program when the inner decision maker control few variables, Hierarchical optimization: An introduction, The computational complexity of multi-level linear programs, The complementary convex structure in global optimization, Bilevel and multilevel programming: A bibliography review, Links between linear bilevel and mixed 0-1 programming problems, On a new class of bilevel programming problems and its use for reformulating mixed integer problems, A bilevel bottleneck programming problem, An interactive approach for integrated multilevel systems in a fuzzy environment, A neural network approach to multiobjective and multilevel programming problems, KKT transformation approach for multi-objective multi-level linear programming problems, Fuzzy multiple level programming, Fuzzy approach for multi-level programming problems, Bilevel programming in traffic planning: Models, methods and challenge, Bilevel linear programming, Fuzzy multilevel programming with a hybrid intelligent algorithm
