A symmetrical linear maxmin approach to disjoint bilinear programming
From MaRDI portal
Publication:1586213
DOI10.1007/s101070050072zbMath0980.90051OpenAlexW2003070114MaRDI QIDQ1586213
Gilles Savard, Pierre Hansen, Brigitte Jaumard, Charles Audet
Publication date: 12 November 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050072
Minimax problems in mathematical programming (90C47) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, A mixed-integer linear programming reduction of disjoint bilinear programs via symbolic variable elimination, The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints, Algorithms for linear programming with linear complementarity constraints, (Global) optimization: historical notes and recent developments, A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent, Bilevel Programming: The Montreal School, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, An LPCC approach to nonconvex quadratic programs, APPROXIMATING NASH EQUILIBRIA IN NONZERO-SUM GAMES, Task assignment with controlled and autonomous agents, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Disjunctive cuts for continuous linear bilevel programming, A new branch-and-bound algorithm for standard quadratic programming problems, New branch-and-Cut algorithm for bilevel linear programming, Relaxations and discretizations for the pooling problem, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Bilevel optimization applied to strategic pricing in competitive electricity markets, The inverse optimal value problem, A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem, A study of local solutions in linear bilevel programming, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, Solving linear programs with complementarity constraints using branch-and-cut, An exact penalty method for weak linear bilevel programming problem, 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, A simplex approach for finding local solutions of a linear bilevel program by equilibrium points
