Article ID: | iaor2005851 |
Country: | Netherlands |
Volume: | 1 |
Issue: | 2 |
Start Page Number: | 189 |
End Page Number: | 203 |
Publication Date: | Nov 2004 |
Journal: | Discrete Optimization |
Authors: | Vyve M. Van, Ortega F. |
Keywords: | programming: linear |
In this paper, we examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin that includes fixed charges on the stocks. Such a model is natural in a production environment where stocking is a complex operation, and appears as a subproblem in more general network design problems. Linear-programming formulations, a dynamic program, the convex hull of integer solutions and a separation algorithm are presented. All these turn out to be very natural extensions of the corresponding results of Barany