On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times

Tao Wu, Leyuan Shi, Joseph Geunes, Kerem Akartunali

Research output: Contribution to journalArticle

13 Citations (Scopus)
66 Downloads (Pure)

Abstract

Several mixed integer programming formulations have been proposed for
modeling capacitated multi-level lot sizing problems with setup times. These formulations include the so-called facility location formulation, the shortest route formulation, and the inventory and lot sizing formulation with (l,S) inequalities. In this paper, we demonstrate the equivalence of these formulations when the integrality requirement is relaxed for any subset of binary setup decision variables. This equivalence has significant implications for decomposition-based methods since same optimal solution values are obtained no matter which formulation is used. In particular, we discuss the relax-and-fix method, a decomposition-based heuristic used for the efficient solution of hard lot sizing problems. Computational tests allow us to compare the effectiveness of different formulations using benchmark problems. The choice of formulation directly affects the required computational effort, and our results therefore provide guidelines on choosing an effective formulation during the development of heuristic-based solution procedures.
Original languageEnglish
Pages (from-to)615-639
Number of pages25
JournalJournal of Global Optimization
Volume53
Issue number4
Early online date31 May 2011
DOIs
Publication statusPublished - Aug 2012

Keywords

  • equivalence
  • strong formulation
  • capacitated
  • multi-level lot
  • sizing problems
  • setup times

Fingerprint Dive into the research topics of 'On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times'. Together they form a unique fingerprint.

  • Cite this