A note on the definition of a linear bilevel programming solution

DOI10.1016/j.amc.2006.01.043zbMath1163.90641MaRDI QIDQ945371

Charles Audet, Gilles Savard, Jean-Paul Haddad

Publication date: 12 September 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.01.043

zbMATH Keywords

optimization; linear bilevel programming

Mathematics Subject Classification ID

90C05: Linear programming

Related Items

Bilevel problems over polyhedra with extreme point optimal solutions, Solving quadratic convex bilevel programming problems using a smoothing method, Linear bilevel multi-follower programming with independent followers, Computing the Pareto frontier of a bi-objective bi-level linear problem using a multiobjective mixed-integer programming algorithm, A method for solving bilevel linear programming problems

Cites Work

• An extended \(K\)th-best approach for linear bilevel programming
• Links between linear bilevel and mixed 0-1 programming problems
• Foundations of bilevel programming
• An extended Kuhn-Tucker approach for linear bilevel programming
• On the definition of linear bilevel programming solution
• New branch-and-Cut algorithm for bilevel linear programming
• A note on the Pareto optimality of solutions to the linear bilevel programming problem
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming