A study of the lot-sizing polytope

A study of the lot-sizing polytope

0.00 Avg rating0 Votes
Article ID: iaor20051077
Country: Germany
Volume: 99
Issue: 3
Start Page Number: 443
End Page Number: 465
Publication Date: Jan 2004
Journal: Mathematical Programming
Authors: ,
Keywords: inventory
Abstract:

The lot-sizing polytope is a fundamental structure contained in many practical production planning problems. Here we study this polytope and identify facet-defining inequalities that cut off all fractional extreme points of its linear programming relaxation, as well as liftings from those facets. We give a polynomial–time combinatorial separation algorithm for the inequalities when capacities are constant. We also report computational experiments on solving the lot-sizing problem with varying cost and capacity characteristics.

Reviews

Required fields are marked *. Your email address will not be published.