DSpace@MIT

# The General N-Location Distribution Problem

## Research and Teaching Output of the MIT Community

 dc.contributor.author Patel, Nitin R. en_US dc.contributor.author Karmarkar, Uday S. en_US dc.date.accessioned 2004-05-28T19:35:03Z dc.date.available 2004-05-28T19:35:03Z dc.date.issued 1973-09 en_US dc.identifier.uri http://hdl.handle.net/1721.1/5349 dc.description.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 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. Specifically, it is shown that there is a correspondence between the optimal policies and the extreme points, edges, faces etc. of the dual feasible region. This method is not directly suitable for the solution of large problems but the exact solution for small problems can be obtained. It is shown that the three location case involves 37 policies as compared to seven for the two location case. 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. Extensions of this work are briefly discussed. en_US dc.description.sponsorship Supported in part by the Office o Naval Research under contract 67-A-0204-0076 en_US dc.format.extent 1746 bytes dc.format.extent 1310205 bytes dc.format.mimetype application/pdf dc.language.iso en_US en_US dc.publisher Massachusetts Institute of Technology, Operations Research Center en_US dc.relation.ispartofseries Operations Research Center Working Paper;OR 024-73 en_US dc.title The General N-Location Distribution Problem en_US dc.type Working Paper en_US
﻿

## Files in this item

Name Size Format Description
OR-024-73.pdf 1.249Mb PDF

MIT-Mirage