A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plan Algorithm

O du Merle, J-L Goffin, C Trouiller and J-Ph Vial

Working Papers from Ecole des Hautes Etudes Commerciales, Universite de Geneve-

Abstract: The capacitated multi-item lot sizing problem consists of finding a production schedule that minimizes over a finite number of periods the total production, holding inventory, and setup costs subject to demand and capacity constraints. Approximate solutions can be obtained by heuristics. In this paper we consider an appraoch based on a Lagrangian relaxation fo the capacity constraints.

Keywords: MATHEMATICS; STATISTICS (search for similar items in EconPapers)
JEL-codes: C6 (search for similar items in EconPapers)
Pages: 29 pages
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:fth:ehecge:97.11

Access Statistics for this paper

More papers in Working Papers from Ecole des Hautes Etudes Commerciales, Universite de Geneve- Suisse; Ecole des Hautes Etudes Commerciales, Universite de Geneve, faculte des SES. 102 Bb. Carl-Vogt CH - 1211 Geneve 4, Suisse. Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().