A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands

  title={A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands},
  author={Minjiao Zhang and Simge K{\"u}ç{\"u}kyavuz and Hande Yaman},
  journal={Operations Research},
In this paper, we study a multi-echelon uncapacitated lot-sizing problem in series (mULS), where the output of the intermediate echelons has its own external demand, and is also an input to the next echelon. We propose a polynomial-time dynamic programming algorithm, which gives a tight, compact extended formulation for the two echelon case (2-ULS). Next, we present a family of valid inequalities for m-ULS, show its strength and give a polynomial-time separation algorithm. We establish a… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 34 references

Production planning by mixed integer programming

  • Y. Pochet, L. Wolsey
  • 2006
Highly Influential
8 Excerpts

Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

  • R. Rardin, L. Wolsey
  • European Journal of Operational Research,
  • 1993
Highly Influential
5 Excerpts

Uncapacitated lot-sizing: The convex hull of solutions

  • I. Barany, T. van Roy, L. Wolsey
  • Mathematical Programming
  • 1984
Highly Influential
8 Excerpts

Plant location, set covering and economic lot-sizes: an O(mn) algorithm for structured problems, chapter in Optimierung bei Graphentheoretischen und Ganzzahligen Probleme, L

  • K. Krarup, O. Bilde
  • Collatz (editor). Birkhauser Verlag
  • 1977
Highly Influential
6 Excerpts

PORTA - A polyhedron transformation algorithm. Version 1.4.1

  • T. Christof, A. Löbel
  • 2008
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…