The dynamic lot size model with quantity discount

This article treats the dynamic lot size model with quantity discount in purchase price. The authors study the problem with two different cost structures: the all-units-discount cost structure and the incremental-discount cost structure. They solve the problem under both discount cost structures by dynamic programming algorithms of complexity O(T³) and O(T²), respectively, with T the number of periods in the planning horizon.