Advertisement

Sensitivity analysis in posynomial geometric programming

  • J. Kyparisis
Contributed Papers

Abstract

Sensitivity analysis results for general parametric posynomial geometric programs are obtained by utilizing recent results from nonlinear programming. Duality theory of geometric programming is exploited to relate the sensitivity results derived for primal and dual geometric programs. The computational aspects of sensitivity calculations are also considered.

Key Words

Sensitivity analysis geometric programming duality nonlinear programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fiacco, A. V., andMcCormick, G. P.,Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.Google Scholar
  2. 2.
    Duffin, R. J., Peterson, E. L., andZener, C. M.,Geometric Programming, John Wiley and Sons, New York, New York, 1967.Google Scholar
  3. 3.
    Wilde, D. J., andBeightler, C. S.,Foundations of Optimization, Prentice-Hall, Englewood Cliffs, New Jersey, 1967.Google Scholar
  4. 4.
    Dembo, R. S.,Sensitivity Analysis in Geometric Programming, Journal of Optimization Theory and Applications, Vol. 37, pp. 1–21, 1982.Google Scholar
  5. 5.
    Theil, H.,Substitution Effects in Geometric Programming, Management Science, Vol. 19, pp. 25–30, 1972.Google Scholar
  6. 6.
    Dinkel, J. J., andKochenberger, G. A.,On Sensitivity Analysis in Geometric Programming, Operations Research, Vol. 25, pp. 155–163, 1977.Google Scholar
  7. 7.
    Dinkel, J. J., andKochenberger, G. A.,An Implementation of Some Implicit Function Theorems with Applications to Sensitivity Analysis, Mathematical Programming, Vol. 15, pp. 261–267, 1978.Google Scholar
  8. 8.
    Dinkel, J. J., Kochenberger, G. A., andWong, S. N.,Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects, ACM Transactions on Mathematical Software, Vol. 4, pp. 1–14, 1978.Google Scholar
  9. 9.
    Fiacco, A. V.,Sensitivity Analysis for Nonlinear Programming Using Penalty Methods, Mathematical Programming, Vol. 10, pp. 287–311, 1976.Google Scholar
  10. 10.
    Fiacco, A. V.,Nonlinear Programming Sensitivity Analysis Results Using Strong Second-Order Assumptions, Numerical Optimization of Dynamic Systems, Edited by L. C. W. Dixon and G. P. Szego, North-Holland, Amsterdam, Holland, 1980.Google Scholar
  11. 11.
    Jittorntrum, K.,Sequential Algorithms in Nonlinear Programming, Australian National University, Canberra, PhD Thesis, 1978.Google Scholar
  12. 12.
    Jittorntrum, K.,Solution Point Differentiability without Strict Complementarity in Nonlinear Programming, Mathematical Programming Study, Vol. 21, pp. 127–138, 1984.Google Scholar
  13. 13.
    Robinson, S. M.,Strongly Regular Generalized Equations, Mathematics of Operations Research, Vol. 5, pp. 43–62, 1980.Google Scholar
  14. 14.
    Wilde, D. J.,Jacobians in Constrained Nonlinear Optimization, Operations Research, Vol. 13, pp. 848–856, 1965.Google Scholar
  15. 15.
    McCormick, G. P.,Optimality Criteria in Nonlinear Programming, Proceedings of a Symposium in Applied Mathematics, Edited by R. W. Cottle and C. E. Lemke, SIAM, Philadelphia, Pennsylvania, 1976.Google Scholar
  16. 16.
    Bigelow, J. H., andShapiro, N. Z.,Implicit Function Theorems for Mathematical Programming and for Systems of Inequalities, Mathematical Programming, Vol. 6, pp. 141–156, 1974.Google Scholar
  17. 17.
    Dembo, R. S.,Dual to Primal Conversion in Geometric Programming, Journal of Optimization Theory and Applications, Vol. 26, pp. 243–252, 1978.Google Scholar

Copyright information

© Plenum Publishing Corporation 1988

Authors and Affiliations

  • J. Kyparisis
    • 1
  1. 1.Department of Decision Sciences, College of Business AdministrationFlorida International UniversityMiami

Personalised recommendations