The Dynamic
![]()
We consider a Dynamic Lot Size Model with perishable items. The ordering
cost and inventory holding cost functions follow quantity discount structures
and an item’s deterioration rate depends on
the age of the item. We show that the problem can be solved by dynamic
programming algorithm of complexity O(T3), where T is the number of periods in the planning horizon.