Skip to main content
SpringerLink
Log in

Geometric programming with signomials

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

Abstract

The difference of twoposynomials (namely, polynomials with arbitrary real exponents, but positive coefficients and positive independent variables) is termed asignomial.

Each signomial program (in which a signomial is to be either minimized or maximized subject to signomial constraints) is transformed into an equivalent posynomial program in which a posynomial is to be minimized subject only to inequality posynomial constraints. The resulting class of posynomial programs is substantially larger than the class of (prototype)geometric programs (namely, posynomial programs in which a posynomial is to be minimized subject only to upper-bound inequality posynomial constraints). However, much of the (prototype) geometric programming theory is generalized by studying theequilibrium solutions to thereversed geometric programs in this larger class. Actually, some of this theory is new even when specialized to the class of prototype geometric programs. On the other hand, all of it can indirectly, but easily, be applied to the much larger class of well-posedalgebraic programs (namely, programs involving real-valued functions that are generated solely by addition, subtraction, multiplication, division, and the extraction of roots).

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., Peterson, E. L., andZener, C.,Geometric Programming — Theory and Application, John Wiley and Sons, New York, 1967.

    Google Scholar 

  2. Zener, C.,A Mathematical Aid in Optimizing Engineering Designs, Proceedings of the National Academy of Sciences of the USA, Vol. 47, No. 4, 1961.

  3. Zener, C.,A Further Mathematical Aid in Optimizing Engineering Designs, Proceedings of the National Academy of Sciences of the USA, Vol. 48, No. 4, 1962.

  4. Avriel, M., andWilde, D. J.,Optimal Condenser Design by Geometric Programming, Stanford University, Chemical Engineering Report, 1966.

  5. Federowicz, A. J., andMazumdar, M.,The Use of Geometric Programming to Maximize Reliability Achieved by Redundancy, ORSA, Vol. 16, No. 5, 1968.

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

    Google Scholar 

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

  8. Blau, G., andWilde, D. J.,Second Order Characterization of Generalized Polynomial Programs, Paper presented at the Princeton International Symposium on Mathematical Programming, 1967.

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

  10. Broverman, A., Federowicz, A. J., andMcWhirter, J., personal communication, 1966.

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

  12. Passy, U.,Condensing Generalized Polynomials, Journal of Optimization Theory and Applications (to appear).

  13. Gale, D., Kuhn, H. W., andTucker, A. W.,Linear Programming and the Theory of Games, Cowles Commission Monograph No. 13, 1951.

  14. Goldman, A. J., andTucker, A. W.,Theory of Linear Programming, Linear Inequalities and Related Systems, Edited by H. W. Kuhn and A. W. Tucker, Princeton University Press, Princeton, New Jersey, 1956.

    Google Scholar 

  15. Duffin, R. J.,Linearizing Geometric Programs, SIAM Review, Vol. 12, No. 2, 1970.

  16. Duffin, R. J., andPeterson, E. L.,Duality Theory for Geometric Programming, SIAM Journal on Applied Mathematics, Vol. 14, No. 6, 1966.

  17. Duffin, R. J., andPeterson, E. L.,Reversed Geometric Programs Treated by Harmonic Means, Indiana University Mathematical Journal (to appear).

  18. Charnes, A., andCooper, W. W.,A Convex Approximant Method for Nonconvex Extensions of Geometric Programming, Proceedings of the National Academy of Sciences of the USA, Vol. 56, No. 5, 1966.

  19. Peterson, E. L.,Symmetric Duality for Generalized Unconstrained Geometric Programming, SIAM Journal on Applied Mathematics, Vol. 19, No. 3, 1970.

  20. Peterson, E. L.,Generalization and Symmetrization of Duality in Geometric Programming (to appear).

  21. Rockafellar, R. T.,Duality and Stability in Extremum Problems Involving Convex Functions, Pacific Journal of Mathematics, Vol. 21, No. 1, 1967.

  22. Rockafellar, R. T.,Duality in Nonlinear Programming, Mathematics of the Decision Sciences, Part 1, Edited by G. B. Dantzig and A. F. Veinott, American Mathematical Society, Providence, Rhode Island, 1968.

    Google Scholar 

  23. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  24. Mangasarian, O. L.,Nonlinear Programming, McGraw-Hill Book Company, New York, 1969.

    Google Scholar 

  25. Zangwill, W. I.,Nonlinear Programming—A Unified Approach, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.

    Google Scholar 

  26. Passy, U., andWilde, D. J.,A Geometric Programming Algorithm for Solving Chemical Equilibrium Problems, SIAM Journal on Applied Mathematics, Vol. 16, No. 2, 1968.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Carnegie-Mellon University, Pittsburgh, Pennsylvania

    R. J. Duffin (Professor)

  2. Department of Industrial Engineering and Management Sciences and Department of Mathematics, Northwestern University, Evanston, Illinois

    E. L. Peterson (Associate Professor)

Authors
  1. R. J. Duffin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. L. Peterson
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by G. B. Dantzig

This research was partially supported by Research Grant No. DA-AROD-31-124-6680 from the Army Research Office, Durham, North Carolina, and by a Summer Fellowship Grant from Northwestern University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Duffin, R.J., Peterson, E.L. Geometric programming with signomials. J Optim Theory Appl 11, 3–35 (1973). https://doi.org/10.1007/BF00934288

Download citation

  • Issue Date:

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

Keywords

Search

Navigation