Skip to main content
SpringerLink
Log in

A computational study of methods for solving polynomial geometric programs

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A computational comparison of several methods for dealing with polynomial geometric programs is presented. Specifically, we compare the complementary programs of Avriel and Williams (Ref. 1) with the reversed programs and the harmonic programs of Duffin and Peterson (Refs. 2, 3). These methods are used to generate a sequence of posynomial geometric programs which are solved using a dual algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Avriel, M., andWilliams, A. C.,Complementary Geometric Programming, SIAM Journal of Applied Mathematics, Vol. 19, No. 1, 1970.

  2. Duffin, R. J., andPeterson, E. L.,Geometric Programming with Signomials, Journal of Optimization Theory and Applications, Vol. 11, No. 1, 1973.

  3. Duffin, R. J., andPeterson, E. L.,Reversed Geometric Programs Treated by Harmonic Means, Indiana University Mathematical Journal, Vol. 22, No. 6, 1972.

  4. Passy, U.,Condensing Generalized Polynomials, Journal of Optimization Theory and Applications, Vol. 9, No. 4, 1972.

  5. Passy, U., andWilde, D. J.,Generalized Polynomial Optimization, SIAM Journal of Applied Mathematics, Vol. 15, No. 5, 1967.

  6. Dinkel, J. J., Kochenberger, G. A., andMcCarl, B.,On the Numerical Solution of Geometric Programs, Symposium on Non-linear Programming, Washington, D.C., 1973; also, Mathematical Programming, Vol. 7, No. 2, 1974.

  7. Duffin, R. J., Peterson, E. L., andZener, C.,Geometric Programming Theory and Applications, John Wiley and Sons, New York, New York, 1967.

    Google Scholar 

  8. Frank, C. J.,An Algorithm for Geometric Programming, Recent Advances in Optimization Techniques, Edited by A. Lavi and T. P. Vogl, John Wiley and Sons, New York, New York, 1965.

    Google Scholar 

  9. Beck, P. A., and Ecker, J. G.,Some Computational Experience with a Modified Convex Simplex Algorithm for Geometric Programming, Journal of Optimization Theory and Applications, Vol. 14, No. 6, 1974.

  10. McCarl, B.,A Computational Study of Polynomial Geometric Programming, The Pennsylvania State University, PhD Thesis, 1973.

  11. Wilde, D. J., andBeightler, C. S.,Foundations of Optimization, Prentice-Hall, Englewood Cliffs, New Jersey, 1967.

    Google Scholar 

  12. Pascual, L. D., andBen-Israel, A.,Constrained Maximization of Posynomials by Geometric Programming, Journal of Optimization Theory and Applications, Vol. 5, No. 2, 1970.

  13. Avriel, M., andWilliams, A. C.,An Extension of Geometric Programming with Applications in Engineering Design, Journal of Engineering Mathematics, Vol. 5, No. 3, 1971.

  14. Himmelblau, D. M.,Applied Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1972.

    Google Scholar 

  15. Bracken, J., andMcCormick, G. P.,Selected Applications of Nonlinear Programming, John Wiley and Sons, New York, New York, 1968.

    Google Scholar 

  16. Averich, H., andJohnson, L. L.,Behavior of the Firm Under Regulatory Constraints, American Economic Review, Vol. 59, pp. 1053–1069, 1962.

    Google Scholar 

  17. Dinkel, J. J., Kochenberger, G. A., andSeppala, Y.,Applications of Geometric Programming to Regional Land-Use Planning Models, Environment and Planning, Vol. 5, pp. 397–408, 1973.

    Google Scholar 

  18. Dinkel, J. J., andKochenberger, G. A.,Applications of Geometric Programming to Marketing Decisions, 41st National TIMS Meeting, Houston, Texas, 1972.

  19. Glass, H., andCooper, L.,Sequential Search: A Method for Solving Constrained Optimization Problems, Journal of the Association for Computing Machinery, Vol. 12, No. 1, 1965.

  20. Rosenbrock, H. H.,An Automatic Method for Finding the Greatest or Least Value of a Function, The Computer Journal, Vol. 3, pp. 175–184, 1960.

    Google Scholar 

  21. Saaty, T. L., andBram, J.,Nonlinear Mathematics, McGraw-Hill Book Company, New York, New York, 1964.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Science and Organizational Behavior, The Pennsylvania State University, University Park, Pennsylvania

    J. J. Dinkel (Associate Professor of Management Science) & G. A. Kochenberger (Associate Professor of Management Science)

  2. Department of Agricultural Economics, Purdue University, Lafayette, Indiana

    B. McCarl (Assistant Professor of Agricultural Economics)

Authors
  1. J. J. Dinkel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. A. Kochenberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. McCarl
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by S. Karamardian

The authors would like to acknowledge the helpful comments of the referees. Also, they would like to acknowledge the programming assistance of Mr. S. N. Wong of The Pennsylvania State University. The first author's research was supported in part by a Research Initiation Grant awarded through The Pennsylvania State University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dinkel, J.J., Kochenberger, G.A. & McCarl, B. A computational study of methods for solving polynomial geometric programs. J Optim Theory Appl 19, 233–259 (1976). https://doi.org/10.1007/BF00934095

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00934095

Key Words

Search

Navigation