An Algorithm for Assigning Uses to Sources in a Special Class of Transportation Problems

Abstract

The paper considers a special class of transportation problems in which the needs of each user are to be supplied entirely by one of the available sources. It is shown that an optimum solution to this special transportation problem is a basic feasible solution to a slightly different standard transportation problem. A branch and bound solution procedure for finding the desired solution to the latter is then presented and illustrated with an example. Then an extension of this problem is considered by allowing the possibility of increasing (at a cost) the source capacities. The problem formulation is shown to provide a generalization to the well-known assignment problem. The solution procedure appears to be relatively more efficient when the number of uses greatly exceeds the number of sources.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1971
Accession Number
AD0739727

Entities

People

  • Gerald L. Thompson
  • V. Srinivasan

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Contracts
  • Markets
  • Military Research
  • New Jersey
  • Operations Research
  • Pennsylvania
  • Personnel Management
  • Procedures (Computers)
  • Schools
  • Standards
  • Transportation
  • Universities

Fields of Study

  • Mathematics

Readers

  • Operations Research