|
Organizers |
A Non-Standard Solution Method for Linear Programming
by
Alastair McNaughton
University of Auckland
A new interior-point method will be outlined. The algorithm involves conceptualising the solution point as rebounding back and forth between the interior faces of the polytope. The associated calculations are basic linear algebra. Convergence appears rapid, and some results from numerical trials will be presented to support this.
Date received: June 7, 1998
Copyright © 1998 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cabd-40.