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
File-URL: https://repub.eur.nl/pub/1927/ERS%202005%20006%20LIS.pdf
File-Format: application/pdf
Series: RePEc:ems:eureri
Number: ERS-2005-006-LIS
Classification-JEL: C69, M, M11, R4
Keywords: Generalized geometric programming, Lagrangian dual, regularity conditions
Handle: RePEc:ems:eureri:1927