Accession Number:

AD0408655

Title:

MODIFIED LINEAR PROGRAMMING

Descriptive Note:

Corporate Author:

ALDERSON ASSOCIATES INC PHILADELPHIA PA

Personal Author(s):

Report Date:

1960-06-01

Pagination or Media Count:

107.0

Abstract:

Under present arrangements the number of large scale transportation routing problems arising out of SPCC redistribution actions is relatively small. A sample indicates that less than five percent of these problems are of sufficient size and complexity to merit sophisticated computa tional treatment. For these purposes a problem was considered to be sizable if it involved no less than seven activities, no less than three consignees and no less than three consignors. However, it is possible to effect worthwhile savings in transportation outlay on these larger redistribution problems. Even approximative techniques which involve no more complex calcu lations thanhe present rules can save about two percent on transportation mileage in the average redistribution problem. This is a rela tively small figure but considering the large snnual outlay on redistribution transportation cost the absolute dollar saving is likely to be considerable. Most of the calculations were based on straightforward mileage tables rather than transportation cost tables or the proximity tables currently in use by SPCC.

Subject Categories:

  • Logistics, Military Facilities and Supplies
  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE