Geometric programming with signomials

  • R. J. Duffin
  • E. L. Peterson
Contributed Papers

DOI: 10.1007/BF00934288

Cite this article as:
Duffin, R.J. & Peterson, E.L. J Optim Theory Appl (1973) 11: 3. doi:10.1007/BF00934288


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).

Copyright information

© Plenum Publishing Corporation 1973

Authors and Affiliations

  • R. J. Duffin
    • 1
  • E. L. Peterson
    • 2
  1. 1.Department of MathematicsCarnegie-Mellon UniversityPittsburgh
  2. 2.Department of Industrial Engineering and Management Sciences and Department of MathematicsNorthwestern UniversityEvanston