A DUAL ALGORITHM FOR THE ECONOMIC LOT-SIZING PROBLEM

被引：9

作者：

VANHOESEL, S ^{[1
]}

WAGELMANS, A ^{[1
]}

KOLEN, A ^{[1
]}

机构：

[1] STATE UNIV LIMBURG,6200 MD MAASTRICHT,NETHERLANDS

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1991年 / 52卷 / 03期

关键词：

INVENTORY; PLANNING; LINEAR PROGRAMMING; ECONOMIC LOT-SIZING;

D O I：

10.1016/0377-2217(91)90166-S

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

A linear description for the economic lot-sizing problem consisting of exponentially many linear inequalities was given by Barany, Van Roy and Wolsey in 1984. Usin this formulation we present a dual algorithm for the economic lot-sizing problem, which is of the same complexity as the Wagner and Whitin dynamic programming algorithm. Besides its use in sensitivity analysis the dual algorithm also provides an alternative proof of the fact that the linear description is complete.

引用

页码：315 / 325

页数：11

共 18 条

[1] OPTIMAL LOT-SIZING ALGORITHMS FOR COMPLEX PRODUCT STRUCTURES [J].