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 usi...

Full description

Saved in:
Bibliographic Details
Published in:Management science 1984-10, Vol.30 (10), p.1255-1261
Main Authors: Barany, Imre, Van Roy, Tony J, Wolsey, Laurence A
Format: Article
Language:English
Subjects:
Algorithms
Computer software
Heuristics
Integers
inventory
Inventory management
inventory/production: lot sizing
Linear programming
Management science
Mathematical models
production: lot sizing
Radiocarbon
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.30.10.1255