Global solutions of mathematical programs with intrinsically concave functions

An implicit enumeration technique for solving a certain type of nonconvex program is described. The method can be used for solving signomial programs with constraint functions defined by sums of quasiconcave functions and other types of programs with constraint functions called intrinsically concave functions. A signomial-type example is solved by this method. The algorithm is described together with a convergence proof. No computational results are available at present.