Template-Type: ReDIF-Paper 1.0
Author-Name: Frenk, J.B.G.
Author-Name-Last: Frenk
Author-Name-First: Hans
Author-Name: Still, G.J.
Author-Name-Last: Still
Title: A note on the dual of an unconstrained (generalized) geometric programming problem
Abstract: 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.
Creation-Date: 2005-04-01
Series: RePEc:ems:eureir
Number: EI 2005-11
Classification-JEL: C69, R4
Keywords: Lagrangian dual, generalized geometric programming, regularity conditions
Handle: RePEc:ems:eureir:19412