Journal article
On a Compound Duality Classification for Geometric Programming
Journal of optimization theory and applications, Vol.180(3), pp.711-728
03/01/2019
DOI: 10.1007/s10957-018-1415-1
Abstract
A classification table for geometric programming is given in this paper. The table is exhaustive and exclusive with only one state in each row and each column. It proves that out of 49 possible duality states, only seven are possible. The proofs of theorems leading to the classification table are based on the new states, which are defined according to the newly defined homogenized programs for both the primal and dual geometric programming.
Details
- Title: Subtitle
- On a Compound Duality Classification for Geometric Programming
- Creators
- Qinghong Zhang - Northern Michigan UniversityKenneth O. Kortanek - University of Pittsburgh
- Resource Type
- Journal article
- Publication Details
- Journal of optimization theory and applications, Vol.180(3), pp.711-728
- DOI
- 10.1007/s10957-018-1415-1
- ISSN
- 0022-3239
- eISSN
- 1573-2878
- Number of pages
- 18
- Language
- English
- Date published
- 03/01/2019
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963202602771
Metrics
2 Record Views