Abstract
This article treats the dynamic lot size model with quantity discount in purchase price. We study the problem with two different cost structures: the all-units-discount cost structure and the incremental-discount cost structure. We solve the problem under both discount cost structures by dynamic programming algorithms of complexity O(T3) and O(T2),respectively, with T the number of periods in the planning horizon.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
