Fenchel and Lagrange Duality are Equivalent

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5352

Full metadata record

DC Field	Value	Language
dc.creator	Magnanti, Thomas L.	-
dc.date	2004-05-28T19:35:12Z	-
dc.date	2004-05-28T19:35:12Z	-
dc.date	1974-07	-
dc.date.accessioned	2013-10-09T02:39:17Z	-
dc.date.available	2013-10-09T02:39:17Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5352	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	A basic result in ordinary (Lagrange) convex programming is the saddlepoint duality theorem concerning optimization problems with convex inequalities and linear-affine equalities satisfying a Slater condition. This note shows that this result is equivalent to the duality theorem of Fenchel.	-
dc.description	Supported in part by the U.S. Army Research Office (Durham) under Contract No. DAHC04-73-C-0032.	-
dc.format	1746 bytes	-
dc.format	499219 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 036-74	-
dc.title	Fenchel and Lagrange Duality are Equivalent	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI