Accession Number : AD0675822

Title :   A MODIFIED SIMPLEX ALGORITHM FOR SOLVING THE MULTI-COMMODITY MAXIMUM FLOW PROBLEM,

Corporate Author : GEORGE WASHINGTON UNIV WASHINGTON D C LOGISTICS RESEARCH PROJECT

Personal Author(s) : Boyer,Donald D. ; Hunt,Donald J.

Report Date : 01 SEP 1968

Pagination or Media Count : 15

Abstract : The paper gives a detailed description of a modified simplex algorithm for solving the arc-chain formulation of the multi-commodity maximum flow problem. The modification of the simplex method is that of using a shortest path computation to replace the simplex step of selecting which vector enters the basis. Some computational results are also given. (Author)

Descriptors :   (*TRANSPORTATION, GRAPHICS), LINEAR PROGRAMMING, SIMPLEX METHOD, PROBLEM SOLVING, OPTIMIZATION, ALGORITHMS

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE