Abstract
The purpose of this paper is to present some points of clarification of a recently presented algorithm for geometric programs [7]. While presenting the clarification, we are able to identify the behavior of condensation type algorithms for generalized geometric programs.
This is a preview of subscription content, log in via an institution to check access.
References
R.A. Abrams, “Consistency, superconsistency, and dual degeneracy in posynomial geometric programming”,Operations Research 24 (1976) 325–335.
J.J. Dinkel, W.E. Elliott and G.A. Kochenberger, “Computational aspects of cutting-plane algorithms for geometric programming problems”,Mathematical Programming 13 (1977) 200–220.
R.J. Duffin, “Linearizing geometric programs”,SIAM Review 12 (1970) 211–227.
R.J. Duffin and E.L. Peterson, “Geometric programming with signomials”,Journal of Optimization Theory and Applications 11 (1973) 3–35.
R.J. Duffin, E.L. Peterson and C. Zener,Geometric programming (Wiley, New York, 1967).
A.J. Fiacco and G.P. McCormick,Nonlinear programming: sequential unconstrained minimization techniques (Wiley, New York, 1968).
M.J. Rijckaert and X.M. Martens, “A condensation method for generalized geometric programming”,Mathematical Programming 11 (1976) 89–93.
W.I. Zangwill,Nonlinear programming (Prentice-Hall, Englewood Cliffs, NJ, 1969).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Dinkel, J.J., Kochenberger, G.A. Some remarks on condensation methods for geometric programs. Mathematical Programming 17, 109–113 (1979). https://doi.org/10.1007/BF01588231
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588231