http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
iterative algorithm for solving "a transportation problem involving source-location optimization"
37, A11 leaves, 8 unnumbered leaves : illustrations ; 28 cm
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.
"Research conducted through the Texas A & M Research Foundation."
Includes bibliographical references (leaf 37).
Sponsored by the Office of Naval Research Contract N00014-68-A-0140 NR047-700
Operations research, mathematical programming
Operations research and management science
Transportation problem involving source-location optimization
College Station, Texas : Texas A & M University, 1972
Technical report (Texas A & M University. Themis Optimization Research Program) ; no. 44