Direct sparse matrix methods for interior point algorithms.
Recent advances in linear programming solution methodology have focused on interior point algorithms. These are powerful new methods, achieving significant reductions in computer time for large LPs and solving problems significantly larger than previously possible. This dissertation describes the im...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
The University of Arizona.
1990
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10150/185133 |