Concavity cuts for disjoint bilinear programming
From MaRDI portal
Publication:5935714
DOI10.1007/s101070100228zbMath0989.90106MaRDI QIDQ5935714
Brigitte Jaumard, Gilles Savard, Stéphane Alarie, Charles Audet
Publication date: 21 February 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
global optimizationbranch-and-bound algorithmconcavity cutsdisjoint bilinear programminglinear maxmin programming
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (18)
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ 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 ⋮ On proper refinement of Nash equilibria for bimatrix games ⋮ Bilevel Programming: The Montreal School ⋮ An effective global algorithm for worst-case linear optimization under polyhedral uncertainty ⋮ Task assignment with controlled and autonomous agents ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ Degeneracy removal in cutting plane methods for disjoint bilinear programming ⋮ Bilevel optimization applied to strategic pricing in competitive electricity markets ⋮ Cyclic seesaw process for optimization and identification ⋮ A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem ⋮ An exact penalty method for weak linear bilevel programming problem ⋮ A survey of network interdiction models and algorithms ⋮ Bidimensional packing by bilinear programming ⋮ New product introduction against a predator: A bilevel mixed-integer programming approach ⋮ Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties ⋮ Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
This page was built for publication: Concavity cuts for disjoint bilinear programming
