A duality-based relaxation and decomposition approach for inventory distribution systems
β Scribed by Sumit Kunnumkal; Huseyin Topaloglu
- Publisher
- John Wiley and Sons
- Year
- 2008
- Tongue
- English
- Weight
- 264 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
We propose a new method for making the inventory replenishment decisions in distribution systems. In particular, we consider distribution systems consisting of multiple retailers that face random demand and a warehouse that supplies the retailers. The method that we propose is based on formulating the distribution problem as a dynamic program, and relaxing the constraints that ensure the nonnegativity of the shipments to the retailers, by associating Lagrange multipliers with them. We show that our method provides lower bounds on the value functions, and a good set of values for the Lagrange multipliers can be obtained by maximizing a concave function in a relatively straightforward manner. Computational experiments indicate that our method can provide significant improvements over the traditional approaches for making the inventory replenishment decisions, in terms of both the tightness of the lower bounds on the value functions and the performance of the policies. Β© 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008
π SIMILAR VOLUMES
## Abstract The heightened focus of global competition has increased the necessity of manufacturing in combination with information technologies to continuously improve production flexibility and product quality, delivery and cost. Coupled with uncertainty and delays in information transmission lag
## Abstract This paper aims to develop a suitable power system restoration method by using mathematical programming (MP). Generally, the problem of determining the target configuration can be formulated as a mixed integer programming (MIP) problem. Whether or not each branch is included in a target
We introduce an infrastructure for easing construction of agent-based systems. We argue that such infrastructure constitutes a convenient solution for releasing agent developers from cumbersome interaction issues inherent to any agent-based system, and therefore for helping them concentrate on the d