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

DOI10.1023/A:1021713105102MaRDI QIDQ1962473zbMATH OpenOpenAlexFDO

Authors 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

existence of a solutionextreme pointsLagrangian dualitylinear bilevel programmingminimal penalty function parameter valuepenalty function approach

Mathematics Subject Classification ID

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

Recommendations

• Solving linear bilevel multiobjective programming problem via exact penalty function approach
• An exact penalty function approach for solving the linear bilevel multiobjective programming problem
• A penalty function approach for solving bi-level linear programs
• scientific article; zbMATH DE number 1778145
• An exact penalty method for weak linear bilevel programming problem

Cites work

• A global optimization approach for the linear two-level program
• A penalty function approach for solving bi-level linear programs
• An investigation of the linear three level programming problem
• Convex Analysis
• First-order necessary optimality conditions for general bilevel programming problems
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• On the structure and properties of a linear multilevel programming problem

Cited in

(6)

• A penalty function approach for solving bi-level linear programs
• On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation
• Discrete linear bilevel programming problem
• Bilevel problems over polyhedra with extreme point optimal solutions
• Algorithms for Linear Bilevel Optimization
• Bilevel optimization: theory, algorithms, applications and a bibliography

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962473)