A geometric program is an optimization problem of the form minimize f 0 subject to f i ≤ 1, i = 1, …, m g i = 1, i = 1, …, p, {\displaystyle {\begin{array}{ll}{\mbox{minimize}}&f_{0}\\{\mbox{subject to}}&f_{i}\leq 1,\quad i=1,\ldots,m\\&g_{i}=1,\quad i=1,\ldots,p,\end{array}}} where f 0, …, f m {\displaystyle f_{0},\dots,f_{m}} are posynomials and g 1, …, g p {\displaystyle g_{1},\dots,g_{p}} are monomials. Wikipedia