Convergent Algorithms for Minimizing a Concave Function
- 1 November 1980
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 5 (4) , 556-566
- https://doi.org/10.1287/moor.5.4.556
Abstract
For the problem of minimizing a concave function over a polytope a class of convergent algorithms is proposed, which is based upon a combination of the branch and bound technique with the cutting method developed earlier by H. Tuy.Keywords
This publication has 0 references indexed in Scilit: