Efficient algorithms for solving rank two and rank three bilinear programming problems

DOI10.1007/BF00119989zbMath0748.90050OpenAlexW2057655209MaRDI QIDQ1186269

Yasutoshi Yajima, Hiroshi Konno

Publication date: 28 June 1992

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonconvex quadratic programmingbilinear programmingparametric simplex algorithmcutting-cake-algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Calculating a minimal sphere containing a polytope defined by a system of linear inequalities, Linear programs with an additional rank two reverse convex constraint, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, A new reformulation-linearization technique for bilinear programming problems, Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial, Generation of disjointly constrained bilinear programming test problems, The simplex method as a global optimizer: A \(C\)-programming perspective, Bilinear separation of two sets in \(n\)-space, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases

Cites Work

• Unnamed Item
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Quasi-concave minimization subject to linear constraints
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• Convergent Algorithms for Minimizing a Concave Function
• The bilinear programming problem
• A cutting plane algorithm for solving bilinear programs
• Maximization of A convex quadratic function under linear constraints
• A Successive Underestimation Method for Concave Minimization Problems
• Bilinear programming: An exact algorithm
• A cutting plane algorithm for the bilinear programming problem
• A linear max—min problem