Discrete lot-sizing and convex integer programming
(2001)
Files
dp2001-8.pdf
Open Access - Adobe PDF
- 266.63 KB
Details
- Authors
- 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.
- Affiliations
Citations
Miller, A. J., & Wolsey, L. (2001). Discrete lot-sizing and convex integer programming (CORE Discussion Papers 2001/8). https://hdl.handle.net/2078.5/34051