A note on the solution of bilinear programming problems by reduction to concave minimization
- 1 May 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 41 (1) , 249-260
- https://doi.org/10.1007/bf01580766
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A finite algorithm for concave minimization over a polyhedronNaval Research Logistics Quarterly, 1985
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cutsMathematical Programming, 1980
- Bilinear programming: An exact algorithmMathematical Programming, 1977
- A cutting plane algorithm for solving bilinear programsMathematical Programming, 1976
- A bilinear programming formulation of the 3-dimensional assignment problemMathematical Programming, 1974
- Optimal Facility Location with Concave CostsOperations Research, 1974
- A linear max—min problemMathematical Programming, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970
- Two-person nonzero-sum games and quadratic programmingJournal of Mathematical Analysis and Applications, 1964