A Study of the Lot-Sizing Polytope

Alper Atamturk and Juan Carlos Munoz

University of California Transportation Center, Working Papers from University of California Transportation Center

Abstract: The lot-sizing polytope is a fundamental structure contained in many practical production planning problems. Here we study this polytope and identify fact-defining inequalities that cut of 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 on an extensive computational study on solving the lot-sizing problem for instances up to 365 time periods with varying cost and capacity characteristics.

Keywords: Architecture (search for similar items in EconPapers)
Date: 2002-09-01
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.escholarship.org/uc/item/9gx170tx.pdf;origin=repeccitec (application/pdf)

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:cdl:uctcwp:qt9gx170tx

Access Statistics for this paper

More papers in University of California Transportation Center, Working Papers from University of California Transportation Center Contact information at EDIRC.
Bibliographic data for series maintained by Lisa Schiff ().