Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
复制标题
针对多项目离散批量问题的紧密 Mip 公式
作者：
Andrew J. Miller;L. Wolsey
本文讨论离散批量问题变量的混合整数规划公式。我们的方法是在这些模型中识别简单的混合整数集，并对这些集应用紧凑的公式。这使得我们可以为存在缺货和/或安全库存的离散批量问题定义整数线性规划公式，并给出其他情况的扩展公式。这些结果对解决激励这项研究的工业应用程序产生的测试用例有重要帮助。
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.