A Successive Underestimation Method for Concave Minimization Problems

Abstract
A new method designed to globally minimize concave functions over linear polyhedra is described. Properties of the method are discussed, an example problem is solved, and computational considerations are discussed.