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

Wu, Tao and Shi, Leyuan and Geunes, Joseph and Akartunali, Kerem (2012) On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times. Journal of Global Optimization, 53 (4). pp. 615-639. ISSN 0925-5001 (https://doi.org/10.1007/s10898-011-9728-8)

[thumbnail of Akartunali JOGO preprint version]
Preview
 PDF. Filename: jogo_prefinal.pdf
Accepted Author Manuscript
Download (358kB)| Preview

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.

ORCID iDs

Wu, Tao, Shi, Leyuan, Geunes, Joseph and Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833;
CORE (COnnecting REpositories)