Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation
成果类型：
Article
署名作者：
Atamtürk, A; Küçükyavuz, S
署名单位：
University of California System; University of California Berkeley
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.1050.0223
发表日期：
2005
页码：
711-730
关键词：
摘要：
We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear cost 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 bounds explicitly and give exact separation algorithms. We also describe a linear programming formulation of the problem when the order and inventory 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.