On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- 1 April 1988
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 7 (2) , 85-90
- https://doi.org/10.1016/0167-6377(88)90071-5
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- A method for globally minimizing concave functions over convex setsMathematical Programming, 1981
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral SetsMathematics of Operations Research, 1980
- A Successive Underestimation Method for Concave Minimization ProblemsMathematics of Operations Research, 1976
- Generalized Cutting Plane AlgorithmsSIAM Journal on Control, 1971