Show simple item record

dc.contributor.authorLeung, Janny M. Y.en_US
dc.contributor.authorMagnanti, Thomas L.en_US
dc.contributor.authorVachani, Ritaen_US
dc.date.accessioned2004-05-28T19:28:14Z
dc.date.available2004-05-28T19:28:14Z
dc.date.issued1987-12en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5210
dc.description.abstractThe dynamic economic lot sizing model, which lies at the core of numerous production planning applications, is one of the most highly studied models in all of operations research. And yet, capacitated multi-item versions of this problem remain computationally elusive. We study the polyhedral structure of an integer programming formulation of a single-item capacitated version of this problem, and use these results to develop solution methods for multi-item applications. In particular, we introduce a set of valid inequalities for the problem and show that they define facets of the underlying integer programming polyhedron. Computational results on several single and multiple product examples show that these inequalities can be used quite effectively to develop an efficient cutting plane/branch and bound procedure. Moreover, our results show that in many instances adding certain of these inequalities a priori to the problem formulation, and avoiding the generation of cutting planes, can be equally effective.en_US
dc.format.extent1744 bytes
dc.format.extent2430408 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 171-87en_US
dc.titleFacets and Algorithms for Capacitated Lot Sizingen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record