A cutting plane algorithm for solving bilinear programs
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 11 (1) , 14-27
- https://doi.org/10.1007/bf01580367
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Maximization of A convex quadratic function under linear constraintsMathematical Programming, 1976
- A linear max—min problemMathematical Programming, 1973
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear ConstraintsOperations Research, 1969
- A method for solving maximum-problems with a nonconcave quadratic objective functionProbability Theory and Related Fields, 1966
- Equilibrium Points of Bimatrix GamesJournal of the Society for Industrial and Applied Mathematics, 1964
- Two-person nonzero-sum games and quadratic programmingJournal of Mathematical Analysis and Applications, 1964
- The Maximization of a Quadratic Function of Variables Subject to Linear InequalitiesManagement Science, 1964
- Equilibrium Points in Finite GamesJournal of the Society for Industrial and Applied Mathematics, 1960
- Nonlinear Power of Adjacent Extreme Point Methods in Linear ProgrammingEconometrica, 1957