Skip to main content
SpringerLink
Log in

Comparison of generalized geometric programming algorithms

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

Abstract

Numerical results are presented of extensive tests involving five posynomial and twelve signomial programming codes. The set of test problems includes problems with a pure mathematical meaning as well as problems originating from different fields of engineering. The algorithms are compared on the basis of CPU time, number of failures, preparation time, and in-core storage.

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. Duffin, R. J., andPeterson, E. L.,Geometric Programming with Signomials, Journal of Optimization Theory and Applications, Vol. 11, pp. 3–35, 1973.

    Google Scholar 

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

    Google Scholar 

  3. Passy, U.,Generalized Weighted Mean Programming, SIAM Journal of Applied Mathematics, Vol. 19, pp. 98–104, 1971.

    Google Scholar 

  4. Duffin, R. J., andPeterson, E. L.,Reversed Geometric Programming Treated by Harmonic Means, Indiana University Mathematics Journal, Vol. 22, pp. 531–550, 1972.

    Google Scholar 

  5. Passy, U., andWilde, D. J.,Mass Action and Polynomial Optimization, Journal of Engineering Mathematics, Vol. 3, pp. 325–335, 1969.

    Google Scholar 

  6. Kochenberger, G.,Geometric Programming: Extensions to Deal with Degrees of Difficulty and Loose Constraints, University of Colorado, PhD Thesis, 1969.

  7. Rijckaert, M. J., andMartens, X. M.,Numerical Aspects of the Use of Slack Variables in Geometric Programming, Katholieke Universiteit Leuven, Chemical Engineering Department, Report No. CE-RM-7501, 1975.

  8. Zangwill, W. I.,Nolinear Programming, a Unified Approach, Prentice Hall, Englewood Cliffs, New Jersey, 1969.

    Google Scholar 

  9. Harwell Subroutine Library, Theoretical Physics Division, Atomic Energy Research Establishment, Harwell, Berkshire, England, 1971.

  10. Kochenberger, A., Woolsey, R. E. D., andMcCarl, B. A.,On the Solution of Geometric Programming via Separable Programming, Operations Research Quarterly, Vol. 24, pp. 285–296, 1973.

    Google Scholar 

  11. Sargent, R. W. H., andMurtagh, B. A.,Projection Methods for Nonlinear Programming, Mathematical Programming, Vol. 4, pp. 245–268, 1973.

    Google Scholar 

  12. Bradley, J.,An Algorithm for the Numerical Solution of Prototype Geometric Programs, Institute of Industrial Research and Standards, Dublin, Ireland, Report, 1973.

  13. Beck, P. A., andEcker, J. G.,A Modified Concave Simplex Algorithm for Geometric Programming, Journal of Optimization Theory and Applications, Vol. 15, pp. 189–202, 1975.

    Google Scholar 

  14. Blau, G., andWilde, D. J.,A Lagrangian Algorithm for Equality Constrained Generalized Polynomial Optimization, AIChE Journal, Vol. 17, pp. 235–240, 1971.

    Google Scholar 

  15. Kuester, J. L., andMize, J. H.,Optimization Techniques with Fortran, McGraw-Hill Book Company, New York, New York, 1973.

    Google Scholar 

  16. Avriel, M., andWilliams, A. C.,Complementary Geometric Programming, SIAM Journal on Applied Mathematics, Vol. 19, pp. 125–141, 1970.

    Google Scholar 

  17. Avriel, M., Dembro, R., andPassy, U.,Solution of Generalized Geometric Programming, International Journal of Numerical Methods in Engineering, Vol. 9, pp. 149–169, 1975.

    Google Scholar 

  18. Templeman, A.,The Use of Geometric Programming Methods for Structural Optimization, AGARD Lectures Series 17, Neuilly-sur-Seine, France, 1974.

    Google Scholar 

  19. Jefferson, T. J.,Geometric Programming with an Application to Transportation Planning, Northwestern University, Urban Systems Engineering Center, Report, 1972.

  20. Rijckaert, M. J., andMartens, X. M.,A Condensation Method for Generalized Geometric Programming, Mathematical Programming, Vol. 11, pp. 89–93, 1976.

    Google Scholar 

  21. Haarhoff, P. C., andBuys, J. D.,A New Method for the Optimization of a Nonlinear Function Subject to Nonlinear Constraints, Computer journal, Vol. 13, pp. 178–184, 1970.

    Google Scholar 

  22. Blau, G. E., andWilde, D. J.,Generalized Polynomial Programming, Canadian Journal of Chemical Engineering, Vol. 47, pp. 317–326, 1969.

    Google Scholar 

  23. Rijckaert, M. J.,Engineering Applications of Geometric Programming, Optimization and Design, Edited by M. Avriel, M. J. Rijckaert, and D. J. Wilde, Prentice Hall, Englewood Cliffs, New Jersey, pp. 195–220, 1973.

    Google Scholar 

  24. Rijckaert, M. J.,Studies in Neit-lineaire Programming, Katholieke Universiteit Leuven, PhD Thesis, 1970.

  25. Hellinckx, L. J., andRijckaert, M. J.,Minimization of Capital Investment for Batch Processes, I1EC Process Design and Development Vol. 10, pp. 422–423, 1971.

    Google Scholar 

  26. Dembo, R. S., Technion, Haifa, Israel, Chemical Engineering Department, MS Thesis, 1972.

  27. Neghabat, F., andStark, R. M.,A Cofferdam Design Optimization, Mathematical Programming, Vol. 3, pp. 263–276, 1972.

    Google Scholar 

  28. Mine, H., andOhno, K.,Decomposition of Mathematical Programming Problems by Dynamic Programming and Its Application to Block Diagonal Geometric Programming, Journal of Mathematical Analysis and Applications, Vol. 32, pp. 370–385, 1970.

    Google Scholar 

  29. Beck, P. A., andEcker, J. G.,Some Computational Experience with a Modified Convex Simplex Algorithm in Geometric Programming, Rensselaer Polytechnic Institute, Report AFSC, 1972.

  30. Martens, X. M.,Optimalisering van Stapsgewijs Uitgevoerde Processen met Behulp van Geometrische Programmering, Katholieke Universiteit Leuven, PhD Thesis, 1971.

  31. Avriel, M., andWilde, D. J.,Optimal Condenser Design by Geometric Programming, I and EC Process Design and Development, Vol. 6, pp. 256–263, 1967.

    Google Scholar 

  32. Rijckaert, M. J., andMartens, X. M.,Analysis and Optimization of the Williams-Otto Process by Geometric Programming, AIChE Journal, Vol. 20, pp. 742–750, 1974.

    Google Scholar 

  33. Bracken, J. andMcCormick, G. P.,Selected Applications of Nonlinear Programming, John Wiley and Sons, New York, New York, pp. 37–45, 1968.

    Google Scholar 

  34. Rijckaert, M. J., andMartens, X. M., Unpublished Material, 1977.

  35. Colville, A. R.,A Comparative Study of Nonlinear Programming Codes, IBM New York Scientific Center, Report No. 320-2949, 1968.

Download references

Author information

Authors and Affiliations

  1. Instituut voor Chemie-Ingenieurstechniek, Katholieke Universiteit te Leuven, Leuvem, Belgium

    M. J. Rijckaert (Professor) & X. M. Martens (Doctoral Student)

Authors
  1. M. J. Rijckaert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. X. M. Martens
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by M. Avriel

The authors wish to thank Messieurs M. Avriel, P. Beck, J. Bradley, R. Dembo, T. Jefferson, R. Sargent and A. Templeman for the possibility of using their respective codes in this study.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rijckaert, M.J., Martens, X.M. Comparison of generalized geometric programming algorithms. J Optim Theory Appl 26, 205–242 (1978). https://doi.org/10.1007/BF00933404

Download citation

  • Issue Date:

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

Key Words

Search

Navigation