A parallel cutting plane algorithm for two-level linear programming problems

MaRDI QIDQ2858627zbMATH OpenFDO

Authors Jianfeng Shao, Hao Liu

Publication date 19 November 2013

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

duality gapglobal optimal solutioncutting planetwo-level linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Recommendations

• A cutting plane algorithm for solving linear bilevel programs
• A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
• scientific article; zbMATH DE number 1264368
• A cutting plane approach for solving linear bilevel programming problems
• An optimal parallel algorithm for linear programming in the plane
• scientific article; zbMATH DE number 4127000
• On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs

This page was built for publication: A parallel cutting plane algorithm for two-level linear programming problems

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