Deriving the properties of linear bilevel programming via a penalty function approach

DOI10.1023/A:1021713105102zbMath0945.90026OpenAlexW106612852MaRDI QIDQ1962473

Yanyan Li

Publication date: 15 October 2000

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021713105102

zbMATH Keywords

extreme pointsexistence of a solutionLagrangian dualitylinear bilevel programmingpenalty function approachminimal penalty function parameter value

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Linear programming (90C05)

Related Items (3)

Bilevel problems over polyhedra with extreme point optimal solutions ⋮ Algorithms for Linear Bilevel Optimization ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Cites Work

• Unnamed Item
• On the structure and properties of a linear multilevel programming problem
• A global optimization approach for the linear two-level program
• A penalty function approach for solving bi-level linear programs
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• An investigation of the linear three level programming problem
• Convex Analysis
• First-order necessary optimality conditions for general bilevel programming problems

This page was built for publication: Deriving the properties of linear bilevel programming via a penalty function approach