The bilinear programming problem
- 1 June 1976
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 23 (2) , 303-309
- https://doi.org/10.1002/nav.3800230212
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Global Maximization of a Convex Function with Linear Inequality ConstraintsOperations Research, 1974
- Generation of the Admissible Boundary of a Convex PolytopeOperations Research, 1974
- Nonlinear Programming: Counterexamples to Two Global Optimization AlgorithmsOperations Research, 1973
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971
- Location-Allocation ProblemsOperations Research, 1963