Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Operations Research Center
  3. Operations Research Center Working Papers
  4. Facets and Algorithms for Capacitated Lot Sizing

Facets and Algorithms for Capacitated Lot Sizing

Thumbnail Image
Download
Name

OR-171-87.pdf

Size

2.32 MB

Format

Adobe PDF

Checksum (MD5)

9c2921c2d226df604d53fe37c36e8c0c

Author(s)
Leung, Janny M. Y.
•
Magnanti, Thomas L.
•
Vachani, Rita
Date Issued
December 1987
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 171-87
Abstract
The 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.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
http://hdl.handle.net/1721.1/5210
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.