Now showing items 1-2 of 2
A direct proof of a result of Thue
(Utilitas Mathematica, 1984)
The Complexity of the Simplex Algorithm
(Carleton 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 ...