| dc.contributor.author | Croxton, Keely L. | en_US |
| dc.contributor.author | Gendon, Bernard | en_US |
| dc.contributor.author | Magnanti, Thomas L. | en_US |
| dc.date.accessioned | 2004-05-28T19:29:19Z | |
| dc.date.available | 2004-05-28T19:29:19Z | |
| dc.date.issued | 2002-07 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/5233 | |
| dc.description.abstract | We study a generic minimization problem with separable non-convex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory. | en_US |
| dc.format.extent | 1744 bytes | |
| dc.format.extent | 729124 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 363-02 | en_US |
| dc.subject | piecewise-linear, integer programming, linear relaxation, Lagrangian relaxation. | en_US |
| dc.title | A Comparison of Mixed-Integer Programming Models for Non-Convex Piecewise Linear Cost Minimization Problems | en_US |
| dc.type | Working Paper | en_US |
