A polyhedral study of lot-sizing with supplier selection

Yijia Zhao, Diego Klabjan*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


The traditional lot-sizing problem is to find the least cost production lot-sizes in several time periods. We consider the lot-sizing model together with simultaneous selection of suppliers, which have variable and fixed costs. We study the underlying polytope. We provide valid inequalities for the uncapacitated case and we give sufficient and necessary conditions for facet-defining inequalities. We also give a full description of the underlying polyhedron. For the general capacitated case, we show how to derive several families of valid inequalities from standard lot-sizing valid inequalities.

Original languageEnglish (US)
Pages (from-to)65-76
Number of pages12
JournalDiscrete Optimization
Issue number2
StatePublished - May 2012


  • Facet-defining
  • Lot-sizing
  • Polyhedral analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'A polyhedral study of lot-sizing with supplier selection'. Together they form a unique fingerprint.

Cite this