A note on the dual of an unconstrained (generalized) geometric programming problem

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.

MoreLess

Year of publication:	2005-04-01
Authors:	Frenk, Frenk, J.B.G. ; Still, G.J.
Institutions:	Faculteit der Economische Wetenschappen, Erasmus Universiteit Rotterdam
Subject:	Lagrangian dual \| generalized geometric programming \| regularity conditions

More details

Series:	Econometric Institute Research Papers. - ISSN 1566-7294.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series RePEc:ems:eureir Number EI 2005-11
Classification:	C69 - Mathematical Methods and Programming. Other ; R4 - Transportation Systems
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10010731624