Discrete lot-sizing and convex integer programming

Andrew J. Miller and Laurence A. Wolsey

No 2001008, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: We study the polyhedral structure of variants of the discrete lot-sizing problem viewed as special cases of convex integer programs. Our approach in studying convex integer programs is to develop results for simple mixed integer sets that can be used to model integer convex objective functions. These results allow us to define integral linear programming formulations for the discrete lot-sizing problem in which backlogging and/or safety stocks are present, and to give extended formulations for other cases. Our results help significantly to solve test cases arising from an industrial application motivating this research.

Date: 2001-02
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2001.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:2001008

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().