Questions tagged [geometric-programming]

For questions related to problems that optimize a posynomial subject to posynomial and monomial constraints.

Filter by
Sorted by
Tagged with
10
votes
2answers
361 views

Geometric programming: Why are the constraints defined to be less than/equal to 1?

In a simple convex optimisation problem, the standard form is given by \begin{align}\min_{\bf x}&\qquad f({\bf x})\\\text{s.t.}&\qquad g_i({\bf x})\le 0,\quad i=1,\cdots,m\\&\qquad h_j({\...