Premium
The dynamic lot size model with quantity discount: Counterexamples and correction
Author(s) -
Xu Jiefeng,
Lu Leonard L.
Publication year - 1998
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199806)45:4<419::aid-nav7>3.0.co;2-8
Subject(s) - counterexample , computer science , dynamic programming , mathematical optimization , unit (ring theory) , operations research , mathematical economics , algorithm , mathematics , discrete mathematics , mathematics education
Federgruen and Lee ([3]) proposed an optimal algorithm for the single‐item dynamic lot size model with all‐unit discount. In this note we show that their algorithm fails to find the optimal solution for some special cases. We also provide a modification to the algorithm to handle them. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 419–422, 1998