A linear programming approach to solving bilinear programmes

DOI10.1007/BF01580892zbMath0784.90052MaRDI QIDQ1207310

Douglas J. White

Publication date: 1 April 1993

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

zbMATH Keywords

bilinear programmingmax-min problem

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05)

Related Items (6)

Task assignment with controlled and autonomous agents ⋮ Accelerating convergence of cutting plane algorithms for disjoint bilinear programming ⋮ Estimating the size of the calling population in finite-source election queues by bilinear programming techniques ⋮ The inverse optimal value problem ⋮ The maximization of a function over the efficient set via a penalty function approach ⋮ Bilinear separation of two sets in \(n\)-space

Cites Work

• Unnamed Item
• A note on the solution of bilinear programming problems by reduction to concave minimization
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A cutting plane algorithm for solving bilinear programs
• A Successive Underestimation Method for Concave Minimization Problems
• A linear max—min problem
• A method for solving maximum-problems with a nonconcave quadratic objective function
• Bemerkungen zum Problem der nichtkonvexen Programmierung

This page was built for publication: A linear programming approach to solving bilinear programmes