In this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] 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.

, ,
,
hdl.handle.net/1765/19412
Econometric Institute Research Papers
Erasmus School of Economics

Frenk, J.B.G, & Still, G.J. (2005). A note on the dual of an unconstrained (generalized) geometric programming problem (No. EI 2005-11). Econometric Institute Research Papers. Retrieved from http://hdl.handle.net/1765/19412