Concavity cuts for disjoint bilinear programming

DOI10.1007/S101070100228MaRDI QIDQ5935714zbMATH OpenFDO

Authors Stéphane Alarie, Charles Audet, Brigitte Jaumard, Gilles Savard

Publication date 21 February 2002

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S101070100228

zbMATH Keywords

branch-and-bound algorithmconcavity cutsdisjoint bilinear programmingglobal optimizationlinear maxmin programming

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• A symmetrical linear maxmin approach to disjoint bilinear programming
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
• A branch-and-cut algorithm for mixed-integer bilinear programming

Cited in

(26)

• Bidimensional packing by bilinear programming
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Cyclic seesaw process for optimization and identification
• On proper refinement of Nash equilibria for bimatrix games
• An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
• A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
• A survey of network interdiction models and algorithms
• Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
• Disjunctive cuts for continuous linear bilevel programming
• Bilevel optimization applied to strategic pricing in competitive electricity markets
• A convex-analysis perspective on disjunctive cuts
• An exact penalty method for weak linear bilevel programming problem
• Disjunctive Cuts for Nonconvex MINLP
• New product introduction against a predator: a bilevel mixed-integer programming approach
• Task assignment with controlled and autonomous agents
• Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem
• Bilevel Programming: The Montreal School
• An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
• A disjunctive cutting plane algorithm for bilinear programming
• Improved randomized approaches to the location of a conservative hyperplane
• An optimality criterion for disjoint bilinear programming and its application to the problem with an acute-angled polytope for a disjoint subset
• Polynomial algorithm for the disjoint bilinear programming problem with an acute-angled polytope for a disjoint subset

This page was built for publication: Concavity cuts for disjoint bilinear programming

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