Accession Number : AD0731694

Title :   Min/Max Bounds for Dynamic Network Flows,

Corporate Author : GEORGE WASHINGTON UNIV WASHINGTON D C PROGRAM IN LOGISTICS

Personal Author(s) : Wilkinson,W. L.

Report Date : 30 JUL 1971

Pagination or Media Count : 24

Abstract : The paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal arc flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria. (Author)

Descriptors :   (*LINEAR PROGRAMMING, NETWORKS), TRANSPORTATION, MATHEMATICAL MODELS, SET THEORY, ITERATIONS, ALGORITHMS, MINIMAX TECHNIQUE, OPTIMIZATION

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE