A branch and bound-outer approximation algorithm for concave minimization over a convex set
- 1 January 1991
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 21 (6-7) , 67-76
- https://doi.org/10.1016/0898-1221(91)90161-v
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex SetMathematics of Operations Research, 1985
- A finite algorithm for concave minimization over a polyhedronNaval Research Logistics Quarterly, 1985
- A method for globally minimizing concave functions over convex setsMathematical Programming, 1981
- Convergent Algorithms for Minimizing a Concave FunctionMathematics of Operations Research, 1980
- An algorithm for nonconvex programming problemsMathematical Programming, 1976
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear ConstraintsOperations Research, 1969
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory SystemsOperations Research, 1969
- A Deterministic Multiproduct, Multi-Facility Production and Inventory ModelOperations Research, 1966