Equivalence of LP relaxations of two strong formulations for the capacitated lot-sizing problem with setups

Denizel, Meltem and Altekin, F. Tevhide and Süral, Haldun and Stadtler, Hartmut (2007) Equivalence of LP relaxations of two strong formulations for the capacitated lot-sizing problem with setups. (Accepted/In Press)

There is a more recent version of this item available.

PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
95Kb

Official URL: http://www.springerlink.com/content/102498/

Abstract

The multi-item capacitated lot-sizing problem (CLSP) has been widely studied in the literature due to its eminent relevance to practice such as constructing a master production schedule. The incorporation of setups crafts CLSP with a realistic feature demanded by practice. In this paper we present a complete proof for the linear equivalence of the shortest path formulation (SP) and the transportation formulation (TP) formulations for the CLSP with setups. Our proof is based on the linear transformation from TP (SP) to SP (TP). We explicitly consider the zero demand case in our proof since it is frequently observed in the real world and test problem instances used in the literature.

Item Type:	Article
Uncontrolled Keywords:	Production; Capacitated Lot-Sizing; Strong Formulation; Linear Relaxation.
Subjects:	Q Science > Q Science (General)
ID Code:	5651
Deposited By:	Meltem Denizel
Deposited On:	11 Oct 2007 21:39
Last Modified:	30 Oct 2008 15:25

Available Versions of this Item

Equivalence of LP relaxations of two strong formulations for the capacitated lot-sizing problem with setups. (deposited 20 Sep 2006 03:00)
- Equivalence of LP relaxations of two strong formulations for the capacitated lot-sizing problem with setups. (deposited 11 Oct 2007 21:39) [Currently Displayed]
  - Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times. (deposited 30 Oct 2008 15:25)

Repository Staff Only: item control page