A Note on the Dual of an Unconstrained (Generalized) Geometric Programming Problem
10 Pages Posted: 9 Sep 2005
Date Written: January 2005 4,
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.
Keywords: Lagrangian dual, Generalized geometric programming, regularity conditions
JEL Classification: M, M11, C69, R4
Suggested Citation: Suggested Citation