A Dual Algorithm for the Economic Lot-Sizing Problem
1991-06-17
Article
pp 315-325.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(eur_wagelmans_24.pdf, 0.6MB) |
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. Using 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.
Keywords
Automatically Extracted Terms
- lot-sizing problem
- period
- lot-sizing
- problem
- production
- algorithm
- solution
- period i
- production period
- .....
- van hoesel
- value
- production periods
- hoesel
- constraint
- zero-inventory property
- inventory
- condition
- section
- construction
