| dc.contributor.author | Magnanti, Thomas L. | en_US |
| dc.date.accessioned | 2004-05-28T19:35:12Z | |
| dc.date.available | 2004-05-28T19:35:12Z | |
| dc.date.issued | 1974-07 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5352 | |
| dc.description.abstract | 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. | en_US |
| dc.description.sponsorship | Supported in part by the U.S. Army Research Office (Durham) under Contract No. DAHC04-73-C-0032. | en_US |
| dc.format.extent | 1746 bytes | |
| dc.format.extent | 499219 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Massachusetts Institute of Technology, Operations Research Center | en_US |
| dc.relation.ispartofseries | Operations Research Center Working Paper;OR 036-74 | en_US |
| dc.title | Fenchel and Lagrange Duality are Equivalent | en_US |
| dc.type | Working Paper | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Operations Research Center | |
