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:	2012
Authors:	Frenk, J. B. G. ; Still, G.
Publisher:	[S.l.] : SSRN

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource (10 p)
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments January 2005 4, erstellt
Classification:	M11 - Production Management ; C69 - Mathematical Methods and Programming. Other ; R4 - Transportation Systems
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10014027587