On a Classification Scheme for Geometric Programming and Complementarity Theorems.
Abstract
A classification theorem for geometric programming is given by using the duality results of Duffin-Peterson-Zener and two properties of a given pair of dual geometric programming problems having subconsistent primal: (1) if the subinfimum is 0, then the dual is inconsistent and (2) if the subinfimum is + infinity then the dual is consistent and unbounded. While (1) and (2) may be derived as corollaries to the Duffin-Peterson-Zener theorems, the authors derivation leads to new complementarity theorems for subconsistent (not necessarily consistent) primal problems. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1971
- Accession Number
- AD0735474
Entities
People
- K. O. Kortanek
- W. Gochet
- Y. Smeers
Organizations
- Carnegie Mellon University