Browsing James D. Currie by Subject "Complexity"
Now showing items 1-1 of 1
-
The Complexity of the Simplex Algorithm
(Carleton UniversityCarleton University, 1984-08)The thesis begins by giving background in linear programming and Simplex methods. Topics covered include the duality theorem, Lemke's algorithm, and the pathological programs of Klee-Minty. Because of the bad behaviour ...