On the global minimization of concave functions
- 1 December 1984
- journal article
- survey
- Published by Springer Nature in OR Spectrum
- Vol. 6 (4) , 195-205
- https://doi.org/10.1007/bf01720068
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Jointly Constrained Biconvex ProgrammingMathematics of Operations Research, 1983
- A method for globally minimizing concave functions over convex setsMathematical Programming, 1981
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedronMathematical Programming, 1977
- Bilinear programming: An exact algorithmMathematical Programming, 1977
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Nonconvex Quadratic Programming via Generalized PolarsSIAM Journal on Applied Mathematics, 1975
- Variations on a cutting plane method for solving concave minimization problems with linear constraintsNaval Research Logistics Quarterly, 1974
- Concave Programming Applied to a Special Class of 0-1 Integer ProgramsOperations Research, 1973
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme PointsOperations Research, 1970
- An Algorithm for Separable Nonconvex Programming ProblemsManagement Science, 1969