BRANCH-AND-BOUND METHOD FOR REVERSED GEOMETRIC-PROGRAMMING

A general or signomial geometric program is a nonlinear mathematical program involving general polynomials in several variables both in the objective function and the constraints. A branch-and-bound method is proposed for this extensive class of nonconvex optimization programs guaranteeing convergence to the global optimum. The subproblems to be solved are convex but the method can easily be combined with a cutting plane technique to generate subproblems which are linear. A simple example is given to illustrate the technique.