Strong Formulations for Multi-Item Capacitated Lot Sizing
Multi-item capacitated lot-sizing problems are reformulated using a class of valid inequalities, which are facets for the single-item uncapacitated problem. Computational results using this reformulation are reported, and problems with up to 20 items and 13 periods have been solved to optimality using a commercial mixed integer code. We also show how the valid inequalities can easily be generated as part of a cutting plane algorithm, and suggest a further class of inequalities that is useful for single-item capacitated problems.
Volume (Year): 30 (1984)
Issue (Month): 10 (October)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:30:y:1984:i:10:p:1255-1261. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.