Article ID: | iaor2003115 |
Country: | Netherlands |
Volume: | 77 |
Issue: | 1 |
Start Page Number: | 53 |
End Page Number: | 61 |
Publication Date: | Jan 2002 |
Journal: | International Journal of Production Economics |
Authors: | Voros Jozsef |
Keywords: | programming: integer |
In this paper the multi level dynamic lot sizing problem is analyzed when setup and holding costs do not depend on time. A zero–one integer programming formulation and its linear relaxation are investigated. The paper shows that for certain classes of problems the relaxed models provide integer solution when the number of periods is below a certain threshold. A counter example shows that at least six periods are required to obtain a unique non-integer solution of the relaxed problem.