Tight MIP formulations for multi-item discrete lot-sizing problems
成果类型：
Article
署名作者：
Miller, AJ; Wolsey, LA
署名单位：
University of Wisconsin System; University of Wisconsin Madison; Universite Catholique Louvain; Universite Catholique Louvain
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.51.4.557.16094
发表日期：
2003
页码：
557-565
关键词：
摘要：
This paper discusses mixed-integer Programming formulations of variants of the discrete lot-sizing problem. Our approach is to identify simple mixed-integer sets within these models and to apply tight formulations for these sets. This allows 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. The results help significantly to solve test cases arising from an industrial application motivating this research.