series: EI 2005-11
A note on the dual of an unconstrained (generalized) geometric programming problem
Redirect to IsSameAs
(IsSameAs.url.txt, 31 bytes)
In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.) is actually a special case of a Lagrangian duality result. Contrary to  we also consider the case that the set C is compact and convex and in this case we do not need to assume the standard regularity condition.