Decomposition in separable geometric programming

Optimization of a special class of geometric programs is achieved by a decomposition technique. Optimal vectors to certain subproblems are obtained by solving a single unconstrained minimization problem involving a strictly convex function. These optimal vector readily yield an optimal vector to the original program.This research was supported in part by funds from NSF Grant No. GP-15031.