Preliminary Concepts of Geometric Programming (GP) Model
Geometric programming (GP) was introduced by Duffin, Peterson, and Zener in their famous book “Geometric programming” Theory and Application in 1967. It is natural to guess that the name “GP” comes from the many geometrical problems that can be formulated as GPs. But in fact, this comes from the arithmetic–geometric mean inequality (A.M.-G.M. inequality). This inequality plays a central role in the analysis of GPs.
- C.S. Beightler, D.T. Philips, Applied Geometric Programming (Wiley, New York, 1976)Google Scholar
- C. Floudas, Deterministic Global Optimization: Theory, Algorithms and Applications (Kluwer Academic, Dordrecht, 1999)Google Scholar
- C. Zener, Engineering Design by Geometric Programming (Wiley, New York, 1971)Google Scholar