dc.contributor.author |
McGregor-Macdonald, Simon |
|
dc.date.accessioned |
2011-07-13T21:40:12Z |
|
dc.date.accessioned |
2022-10-27T01:37:09Z |
|
dc.date.available |
2011-07-13T21:40:12Z |
|
dc.date.available |
2022-10-27T01:37:09Z |
|
dc.date.copyright |
2000 |
|
dc.date.issued |
2000 |
|
dc.identifier.uri |
https://ir.wgtn.ac.nz/handle/123456789/25454 |
|
dc.description.abstract |
This thesis introduces path-following methods for linear programming and compares them to the simplex method. This comparison involves three aspects of each method: mathematical basis of the methodology, theoretical computational complexity and computational performance in practice. Path-following methods follow the central path through the interior of the feasible region, whereas the simplex method traces around the boundary. The computational complexity of path-following methods is shown to be polynomial, while the simplex method is exponential in the worst-case. The experience of practitioners gives overwhelming evidence of the performance of the simplex method, but implementations of path-following methods can be competitive with the simplex method. |
en_NZ |
dc.format |
pdf |
en_NZ |
dc.language |
en_NZ |
|
dc.language.iso |
en_NZ |
|
dc.publisher |
Te Herenga Waka—Victoria University of Wellington |
en_NZ |
dc.title |
Path-following methods for linear programming: a comparison with the simplex method |
en_NZ |
dc.type |
Text |
en_NZ |
vuwschema.type.vuw |
Awarded Research Masters Thesis |
en_NZ |
thesis.degree.grantor |
Te Herenga Waka—Victoria University of Wellington |
en_NZ |
thesis.degree.level |
Masters |
en_NZ |
thesis.degree.name |
Master of Science |
en_NZ |