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

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.

MoreLess

Year of publication:	1997
Authors:	du Merle, O ; Goffin, J-L ; Trouiller, C ; Vial, J-Ph
Institutions:	Geneva School of Economics and Management, Université de Genève
Subject:	MATHEMATICS \| STATISTICS

More details

Series:	Ecole des Hautes Etudes Commerciales, Universite de Geneve-.
Type of publication:	Book / Working Paper
Notes:	29 pages
Classification:	C6 - Mathematical Methods and Programming
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005779569