Geometric Programming via a Primal Auxiliary Problem

Abstract

This paper suggests the solution of geometric programs with degrees of difficulty by means of an auxiliary problem which is the reduced equivalent of the primal problem. The auxiliary problem is derived from the primal program by direct algebraic transformation and has a highly simplified convex separable structure. Using a condensation technique introduced by Duffin, it is shown that generalized polynomial programs can be solved via a sequence of approximating problems with a similar convex separable structure.