Linear programming based decomposition methods for inventory distribution systems

doi:10.1016/j.ejor.2010.11.026

Linear programming based decomposition methods for inventory distribution systems

2011-06-01

11

OA

AI

DOI：10.1016/j.ejor.2010.11.026

原文链接

查看原文

摘要

En 中文

We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse replenishes its stock from an external supplier. The objective is to minimize the total expected replenishment, holding and backlogging cost over a finite planning horizon. The problem can be formulated as a dynamic program, but this dynamic program is difficult to solve due to its high dimensional state variable. It has been observed in the earlier literature that if the warehouse is allowed to ship negative quantities to the retailers, then the problem decomposes by the locations. One way to exploit this observation is to relax the constraints that ensure the nonnegativity of the shipments to the retailers by associating Lagrange multipliers with them, which naturally raises the question of how to choose a good set of Lagrange multipliers. In this paper, we propose efficient methods that choose a good set of Lagrange multipliers by solving linear programming approximations to the inventory distribution problem. Computational experiments indicate that the inventory replenishment policies obtained by our approach can outperform several standard benchmarks by significant margins. (C) 2010 Elsevier B.V. All rights reserved.

Keyword:

Inventory distribution

Approximate dynamic programming

Inventory control

Linear programming based decomposition methods for inventory distribution systems

摘要

AI总结

期刊

机构