The one‐period, N‐location distribution problem
Uday S. Karmarkar, Nitin R. Patel · Naval Research Logistics Quarterly · 1977
Abstract This paper studies the one‐period, general network distribution problem with linear costs. The approach is to decompose the problem into a transportation problem that represents a stocking decision, and into decoupled newsboy problems that represent the realization of demand with the usual associated holding and shortage costs. This approach leads to a characterization of optimal policies in terms of the dual of the transportation problem. This method is not directly suitable for the solution for large problems, but the exact solution for small problems can be obtained. For the numerical solutions of large problems, the problem has been formulated as a linear program with column generation. This latter approach is quite robust in the sense that it is easily extended to incorporate capacity constraints and the multiproduct case.
Cited by 99 works. doi:10.1002/nav.3800240405
Authors
References
- Optimization Theory of Large Systems
- Multistage Inventory Models and Techniques
- Redistribution of total stock over several user locations
- The one‐period, N‐location distribution problem
- Supply and Redistribution Rules for Two-Location Inventory Systems: One-Period Analysis
- On Stochastic Linear Programming
- A Stochastic Transportation Problem
- Allocation under Uncertainty when the Demand has Continuous D.F.