Technical Note—On Sensitivity Analysis in Geometric Programming

This note develops efficient sensitivity procedures for posynomial geometric programs. These procedures provide ranging information for the primal coefficients, means for dealing with problems with loose primal constraints, and an incremental procedure for improving the estimated solutions. These sensitivity procedures are independent of the method of solution of the geometric program.