Journal of Optimization Theory and Applications

, Volume 26, Issue 1, pp 43–50 | Cite as

Constrained duality via unconstrained duality in generalized geometric programming

  • E. L. Peterson
Contributed Papers

Abstract

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 Words

Geometric programming unconstrained duality constrained duality conjugate transform dual cone 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. 1.
    Peterson, E. L.,Geometric Programming, SIAM Review, Vol. 18, pp. 1–51, 1976.Google Scholar

Copyright information

© Plenum Publishing Corporation 1978

Authors and Affiliations

  • E. L. Peterson
    • 1
  1. 1.Department of Engineering Sciences and Applied Mathematics, Department of Industrial Engineering and Management Sciences, and Department of MathematicsNorthwestern UniversityEvanston

Personalised recommendations