Polynomial-Time Solvability of Dynamic Lot Size Problems

Chung Lun Li, Qingying Li

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)


There has been a lot of research on dynamic lot sizing problems with different nonlinear cost structures due to capacitated production, minimum order quantity requirements, availability of quantity discounts, etc. Developing optimal solutions efficiently for dynamic lot sizing models with nonlinear cost functions is a challenging topic. In this paper, we present a set of sufficient conditions such that if a single-item dynamic lot sizing problem satisfies these conditions, then the existence of a polynomial-time solution method for the problem is guaranteed. Several examples are presented to demonstrate the use of these sufficient conditions.
Original languageEnglish
Article number1650018
JournalAsia-Pacific Journal of Operational Research
Issue number3
Publication statusPublished - 1 Jun 2016


  • dynamic lot sizing
  • dynamic programming
  • Inventory
  • polynomial-time algorithms

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this