The iterative algorithm for solving "a transportation problem involving source-location optimization" /
| Main Author: | |
|---|---|
| Corporate Authors: | , |
| Format: | Book |
| Language: | English |
| Published: |
[College Station, Tex.] :
Institute of Statistics, Texas A & M University,
1973.
|
| Series: | Technical report (Texas A & M University. Themis Optimization Research Program) ;
no. 44. |
| Subjects: |
| Abstract: | This report is a documentation of a computer program implementing the iterative algorithm described in Technical Report No. 42, "A Transportation Problem Involving Source-Location Optimization". The general source-location problem under consideration is how to supply J destinations with D sub 1, D sub 2, ..., D sub J units from K possible sources at a minimum cost when the K sources have capacities B sub 1, B sub 2, ..., B sub K, and any subset of the K sources can be located at any one of I locations. A minimal cost solution involves the specification of each source's location and the allocation of the demands D sub 1, D sub 2, ..., D sub J among the sources. The theoretical characteristics and practical performance of the iterative algorithm make the algorithm an attractive method for determining near optimal solutions to such source-location problems. |
|---|---|
| Item Description: | "September 1973." "Research conducted through the Texas A & M Research Foundation." Contains photocopies. |
| Physical Description: | 37, A11 leaves, 8 unnumbered leaves : illustrations ; 28 cm |
| Bibliography: | Includes bibliographical references (leaf 37). |