Negative Cycles, Duality and the Simplex Method.
Operations research rept.,
NORTH CAROLINA STATE UNIV RALEIGH DEPT OF INDUSTRIAL ENGINEERING
Pagination or Media Count:
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
- Operations Research