Abstract
This paper surveys the main developments in the area of sensitivity analysis for geometric programming problems, including both the theoretical and computational aspects. It presents results which characterize solution existence, continuity, and differentiability properties for primal and dual geometric programs as well as the optimal value function differentiability properties for primal and dual programs. It also provides an overview of main computational approaches to sensitivity analysis in geometric programming which attempt to estimate new optimal solutions resulting from perturbations in some problem parameters.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
C.S. Beightler and D.T. Phillips,Applied Geometric Programming (Wiley, New York, 1976).
J.H. Bigelow and N.Z. Shapiro, Implicit function theorems for mathematical programming and for systems of inequalities, Math. Programming 6 (1974) 141–156.
R.S. Dembo, Dual to primal conversion in geometric programming, J. Optim. Theory Appl. 26 (1978) 243–252.
R.S. Dembo, The sensitivity of optimal engineering designs using geometric programming, Eng. Optim. 5 (1980) 27–40.
R.S. Dembo, Sensitivity analysis in geometric programming, J. Optim. Theory Appl. 37 (1982) 1–21.
J.J. Dinkel and G.A. Kochenberger, A note on “Substitution effects in geometric programming”. Management Sci. 20 (1974) 1141–1143.
J.J. Dinkel and G.A. Kochenberger, On sensitivity analysis in geometric programming, Oper. Res. 25 (1977) 155–163.
J.J. Dinkel and G.A. Kochenberger, Sensitivity analysis of optimal design via geometric programming, Eng. Optim. 4 (1979).
J.J. Dinkel and G.A. Kochenberger, Constrained entropy models: solvability and sensitivity, Management Sci. 25 (1979) 555–564.
J.J. Dinkel, G.A. Kochenberger and S.N. Wong, Entropy maximization and geometric programming, Environment and Planning 9 (1977) 419–427.
J.J. Dinkel, G.A. Kochenberger and S.N. Wong, Sensitivity analysis procedures for geometric programs: computational aspects, ACM Trans. Math. Software 4 (1978) 1–14.
J.J. Dinkel, G.A. Kochenberger and D.S. Wong, Parametric analysis in geometric programming: an incremental approach, in:1st Symp. on Mathematical Programming with Data Perturbations, ed. A.V. Fiacco (Marcel Dekker, New York, 1982) pp. 93–109.
J.J. Dinkel, G.A. Kochenberger and D.S. Wong, A sensitivity analysis approach to iteration skipping in the harmonic mean algorithm, in:2nd Symp. on Mathematical Programming with Data Perturbations, ed. A.V. Fiacco (Marcel Dekker, New York, 1983) pp. 109–130.
J.J. Dinkel and M.J. Tretter, An interval arithmetic approach to sensitivity analysis in geometric programming, Oper. Res. 35 (1987) 859–866.
J.J. Dinkel and D. Wong, Application of sensitivity analysis to the optimization of petroleum drilling operations, Comput. Oper. Res. 11 (1984) 129–140.
R.J. Duffin, E.L. Peterson and C.M. Zener,Geometric Programming (Wiley, New York, 1967).
S.C. Fang, E.L. Peterson and J.R. Rajasekera, Controlled dual perturbations for posynomial programs, Europ. J. Oper. Res. 35 (1988) 111–117.
S.C. Fang and J.R. Rajasekera, A perturbation approach to the main duality theorem of quadratic geometric programming, Z. Oper. Res. 31 (1987) A103-A118.
A.V. Fiacco, Sensitivity analysis for nonlinear programming using penalty methods, Math. Programming 10 (1976) 287–311.
A.V. Fiacco,Introduction to Sensitivity and Stability Analysis in Nonlinear Programming (Academic Press, New York, 1983).
A.V. Fiacco and G.P. McCormick,Nonlinear Programming: Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968).
K. Jittorntrum, Solution point differentiability without strict complementarity in nonlinear programming, Math. Programming Study 21 (1984) 127–138.
J. Kyparisis, Optimal value bounds for posynomial geometric programs, Technical Report T-464, Institute for Management Science and Engineering, The George Washington University, Washington, DC 20052 (1982).
J. Kyparisis, Sensitivity analysis in posynomial geometric programming, J. Optim. Theory Appl. 57 (1988) 85–121.
E.L. Peterson, Geometric programming, SIAM Rev. 18 (1976) 1–51.
H. Theil, Substitution effects in geometric programming, Management Sci. 19 (1972) 25–30.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kyparisis, J. Sensitivity analysis in geometric programming: Theory and computations. Ann Oper Res 27, 39–63 (1990). https://doi.org/10.1007/BF02055189
Issue Date:
DOI: https://doi.org/10.1007/BF02055189