On Geometric Programming with Slack Constraints and Degrees of Difficulty

Abstract

This note reviews the effects of singularity, degeneracy, and zero decision variables on the constrained derivative algorithm for solving generalized geometric programs presented in an earlier work. It is shown that the first two pathologies are easily accommodated and that the third may require the application of the algorithm in several successive stages.