Journal article
On a classification scheme for geometric programming and complementarity theorems
Applicable analysis, Vol.6(1), pp.47-59
01/01/1976
DOI: 10.1080/00036817608839138
Abstract
A classification theorem is given stating that out of 18 duality states between a pair of dual geometric programs only 7 are possible. The impossible states are proved by using the duality results of Duffin-Peterson-Zener [9] and two properties associated with a subconsistent primal: (1) if the subinfimum is 0, then the dual is inconsistent and (2) if the subinfimum is + α, then the dual is consistent and unbounded. New complementarity theorems are also given between a given term of a posynomial and the associated dual variable. These results apply to subconsistent programs thereby generalizing results of Avriel-Williams [1]
Details
- Title: Subtitle
- On a classification scheme for geometric programming and complementarity theorems
- Creators
- W. Gochet - Center for Operations Research and EconometricsK.O. Kortanek - Carnegie Mellon UniversityY. Smeers - Center for Operations Research and Econometrics
- Resource Type
- Journal article
- Publication Details
- Applicable analysis, Vol.6(1), pp.47-59
- DOI
- 10.1080/00036817608839138
- ISSN
- 0003-6811
- eISSN
- 1563-504X
- Publisher
- Gordon and Breach Science Publishers Ltd
- Number of pages
- 13
- Language
- English
- Date published
- 01/01/1976
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963214602771
Metrics
1 Record Views