Constrained duality via unconstrained duality in generalized geometric programming
- 40 Downloads
A specialization of unconstrained duality (involving problems without explicit constraints) to constrained duality (involving problems with explicit constraints) provides an efficient mechanism for extending to the latter many important theorems that were previously established for the former.
Key WordsGeometric programming unconstrained duality constrained duality conjugate transform dual cone
Unable to display preview. Download preview PDF.
- 1.Peterson, E. L.,Geometric Programming, SIAM Review, Vol. 18, pp. 1–51, 1976.Google Scholar