A cutting plane algorithm for solving linear bilevel programs

MaRDI QIDQ2858238zbMATH OpenFDO

Authors Yibing Lü, Zhongping Wan

Publication date 19 November 2013

Published in Mathematics in Practice and Theory (Search for Journal in Brave)

zbMATH Keywords

global optimal solutioncutting planelinear bilevel programmingK-T optimality condition

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1264368
• A cutting plane approach for solving linear bilevel programming problems
• scientific article; zbMATH DE number 1145365
• Optimal plane algorithm for the linear bilevel programming problem
• Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm

Cited in

(9)

• A cutting plane method for bilevel linear programming with interval coefficients
• Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
• New branch-and-Cut algorithm for bilevel linear programming
• On the use of intersection cuts for bilevel optimization
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• A cutting plane approach for solving linear bilevel programming problems
• Optimal plane algorithm for the linear bilevel programming problem
• A parallel cutting plane algorithm for two-level linear programming problems
• scientific article; zbMATH DE number 3984967 (Why is no real title available?)

This page was built for publication: A cutting plane algorithm for solving linear bilevel programs

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