Optimization Online


Uncapacitated Lot Sizing with Backlogging: The Convex Hull

Simge Kucukyavuz (simge***at***sie.arizona.edu)
Yves Pochet (pochet***at***core.ucl.ac.be)

Abstract: An explicit description of the convex hull of solutions to the uncapacitated lot-sizing problem with backlogging, in its natural space of production, setup, inventory and backlogging variables, has been an open question for many years. In this paper, we identify facet-defining inequalities that subsume all previously known valid inequalities for this problem. We show that theses inequalities are enough to describe the convex hull of solutions. We give polynomial separation algorithms for some special cases. Finally, we report a summary of computational experiments with our inequalities that illustrates their effectiveness.

Keywords: Lot-sizing, backlogging, facets, separation algorithms, computation

Category 1: Applications -- OR and Management Sciences

Category 2: Integer Programming (Cutting Plane Approaches )

Category 3: Combinatorial Optimization (Polyhedra )

Citation: CORE Discussion Paper, 2007/6

Download: [PDF]

Entry Submitted: 06/09/2006
Entry Accepted: 06/12/2006
Entry Last Modified: 02/21/2007

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society