| dc.contributor.author | Currie, James | |
| dc.date.accessioned | 2019-06-07T17:53:58Z | |
| dc.date.available | 2019-06-07T17:53:58Z | |
| dc.date.issued | 1984-08 | |
| dc.identifier.citation | Currie, James D. The Complexity of the Simplex Algorithm; A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science, Department of Mathematics and Statistics, Carleton University, August 1984. | |
| dc.identifier.uri | http://hdl.handle.net/10680/1695 | |
| dc.description.abstract | 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 of Klee-Minty programs, the behaviour of the Simplex algorithm is only good on average. To take such an average, certain assumptions on the distribution of linear programs are introduced and discussed.
A geometrical meaning is given for the number of steps Lemke's algorithm takes to solve a program. This gives rise to a formula bounding the average number of steps taken. This formula is heuristically justified in an original way.
The formula is combinatorially simplified, to get a bound on the complexity of Simplex. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Carleton University | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Simplex algorithm | en_US |
| dc.subject | Lemke's algorithm | |
| dc.subject | Complexity | |
| dc.subject | Linear programming | |
| dc.title | The Complexity of the Simplex Algorithm | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | MSc | en_US |
| dc.publisher.grantor | Carleton University | |
