Accession Number:

AD0731694

Title:

Min/Max Bounds for Dynamic Network Flows,

Descriptive Note:

Corporate Author:

GEORGE WASHINGTON UNIV WASHINGTON D C PROGRAM IN LOGISTICS

Personal Author(s):

Report Date:

1971-07-30

Pagination or Media Count:

24.0

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

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE