Geometric programming was introduced in 1967 by Duffin, Peterson and Zener. It is very useful in the applications of a variety of optimization problems, and falls under the general class of signomial problems[1]. It can be used to solve large scale, practical problems by quantifying them into a mathematical optimization model. Geometric programs (GP) are useful in the context of geometric design and models well approximated by power laws. Applications of GP include electrical circuit design and other topics such as finance and statistics[2].

Last modified

• 11/30/2018

Creator

• Helen Wu

DOI

• https://doi.org/10.21985/N2NX7C

Keyword

• Geometric Programming

Rights statement

• In Copyright