Efficient Solution Procedure of Geometric Programming Problems with Single-term Constraint Equations

Geometric programming is a powerful optimization technique used in engineering design and management. Geometric programming is designed to optimize a nonlinear objective function with nonlinear inequality constraints. This article describes and expands the technique to take advantage of problems possessing single-term constraint equations. The efficiency of the solution procedure is nearly independent of the number of terms in the problem. The technique is demonstrated by optimizing a cylindrical storage tank design.