Accession Number:

AD0758016

Title:

Negative Cycles, Duality and the Simplex Method.

Descriptive Note:

Operations research rept.,

Corporate Author:

NORTH CAROLINA STATE UNIV RALEIGH DEPT OF INDUSTRIAL ENGINEERING

Report Date:

1973-03-15

Pagination or Media Count:

15.0

Abstract:

The minimal cost flow problem can be solved by several types of algorithms. Two such methods are the simplex method of linear programming and the negative cycle method. This paper provides a duality result for the negative cycle method and illustrates several differences between the two methods. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE