Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming

DOI10.1007/S11590-018-01382-WMaRDI QIDQ2329684zbMATH OpenOpenAlexFDO

Authors Xi Chen, Tian Yang, Jing-yi Qian, Jihong Zhang, Xiaosong Ding

Publication date 18 October 2019

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-018-01382-w

zbMATH Keywords

conservative cutcutting plane methoddegeneracy removal

Mathematics Subject Classification ID

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

Recommendations

• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
• Concavity cuts for disjoint bilinear programming
• scientific article; zbMATH DE number 1264368
• A symmetrical linear maxmin approach to disjoint bilinear programming

Cites work

• A cutting plane algorithm for solving bilinear programs
• A cutting plane algorithm for the bilinear programming problem
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Bilinear modeling solution approach for fixed charge network flow problems
• Concavity cuts for disjoint bilinear programming
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• On the hierarchy of γ-valid cuts in global optimization

Cited in

(6)

• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Concavity cuts for disjoint bilinear programming
• A dual method for polar cuts in disjoint bilinear programming
• A disjunctive cutting plane algorithm for bilinear programming
• Improved randomized approaches to the location of a conservative hyperplane

This page was built for publication: Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming

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