Key points are not available for this paper at this time.
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.
Thoại et al. (Sat,) studied this question.