Decomposition in multi-item inventory control
This paper considers a Lagrangian decomposition approach to a stochastic demand multi-item inventory control problem with a single resource constraint. The work is a generalization of existing decomposition methods. Three decomposition methods are proposed, and bounds on the loss of optimality for each are given in terms of the Lagrange multiplier used. One method allows the calculation of the complete decision rule in advance of the realization of the states, but is expected to perform worse than the other two methods. The second and third method allow the determination of decisions as an optimization problem as the states are realized. Since, in any problem with many states, only a small proportion will actually be realized even in a large time-horizon problem, there may be some advantage in taking this approach.
- Linear programming based decomposition methods for inventory distribution systems
- A duality-based relaxation and decomposition approach for inventory distribution systems
- Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
- An analytical theory of multi‐echelon production/distribution systems
- An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
- Countable-state average-cost regenerative stopping problems
- Discounted Dynamic Programming
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- scientific article; zbMATH DE number 3130649 (Why is no real title available?)
- scientific article; zbMATH DE number 3717118 (Why is no real title available?)
This page was built for publication: Decomposition in multi-item inventory control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1078056)
