Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
Alper Atamturk (atamturkieor.berkeley.edu)
Abstract: We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear costs on inventory, the other with linear and fixed costs on inventory. For both models, we identify facet-defining inequalities that make use of the inventory capacities explicitly and give exact separation algorithms. We also give a linear programming formulation of the problem when the order and inventory variable costs satisfy the Wagner-Whitin nonspeculative property. We present computational experiments that show the effectiveness of the results in tightening the linear programming relaxations of the lot-sizing problem with inventory bounds and fixed costs.
Keywords: Lot sizing, facets, separation algorithms, computation.
Category 1: Applications -- OR and Management Sciences (Production and Logistics )
Category 2: Integer Programming (Cutting Plane Approaches )
Citation: Operations Research 53, 711-730, 2005
Entry Submitted: 07/15/2003
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|