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
Personal Author(s) : Bennington,Gerald E. ; Coppins,Richard J.
Report Date : 15 MAR 1973
Pagination or Media Count : 15
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)
Descriptors : (*LINEAR PROGRAMMING, ALGORITHMS), SIMPLEX METHOD, OPTIMIZATION, NETWORKS, THEOREMS
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE