A penalty treatment of equality constraints in generalized geometric programming

A technique is described for solving generalized geometric programs whose constraints include one or more strict equalities. The algorithm solves a sequence of penalized geometric programs; the penalty functions are derived from the arithmetic-geometric inequality as condensed posynomials. Two examples serve to illustrate the idea.