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.
Similar content being viewed by others
References
Gochet, W., Kortanek, K.O., Smeers, Y.: On a classification scheme for geometric programming and complementarity theorems. Appl. Anal. 6, 47–59 (1976)
Gochet, W., Smeers, Y.: Constraint sets of geometric programs characterized by auxiliary problems. SIAM J. Appl. Math. 29, 708–718 (1975)
Kortanek, K.O.: Classifying convex extremum problems over linear topologies having separation properties. J. Math. Anal. Appl. 46, 725–755 (1974)
Glineur, F.: Proving strong duality for geometric optimization using a conic formulation. Ann. Oper. Res. 105, 155–184 (2001)
Kortanek, K.O.: On a compound duality classification scheme with homogeneous derivants. Rend. di Mat. 5, 1–8 (1972)
Duffin, R.J., Peterson, E.L., Zener, C.: Geometric Programming. Wiley, New York (1967)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Acknowledgements
The authors are indebted to an anonymous referee for many useful comments and suggestions, which helped improve the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Radu loan Bot.
Rights and permissions
About this article
Cite this article
Zhang, Q., Kortanek, K.O. On a Compound Duality Classification for Geometric Programming. J Optim Theory Appl 180, 711–728 (2019). https://doi.org/10.1007/s10957-018-1415-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-018-1415-1