Article ID: | iaor20011220 |
Country: | Netherlands |
Volume: | 66 |
Issue: | 1 |
Start Page Number: | 13 |
End Page Number: | 22 |
Publication Date: | Jan 2000 |
Journal: | International Journal of Production Economics |
Authors: | Wagelmans A.P.M., Hoesel S.P.M. van |
Keywords: | programming: dynamic |
In this paper we consider the important special case of the economic lot-sizing problem in which there are no speculative motives to hold inventory. We analyze the effects of varying all setup costs by the same amount. This is equivalent to studying the set of optimal production periods when the number of such periods changes. We show that this optimal set changes in a very structured way. This fact is interesting in itself and can be used to develop faster algorithms for such problems as the computation of the stability region and the determination of all efficient solutions of a lot-sizing problem. Furthermore, we generalize two related convexity results which have appeared in the literature.