Abstract
We have developed two public domain linear programming programs for several years, LPAKO and LPABO, which can solve large-scale sparse LP problems stably and fast. In this paper, several important numerical aspects which were considered in developing LPAKO and LPABO are presented. Common issues are scaling, tolerances and presolving. For the LPAKO, LU factorization and pivoting rule are important aspects. In case of LPABO, Cholesky factorization, ordering and dense column handling are important. In the end of this paper, several issues to be considered in the future development are proposed.
Original language | English |
---|---|
Pages (from-to) | 217-228 |
Number of pages | 12 |
Journal | Journal of Computational and Applied Mathematics |
Volume | 152 |
Issue number | 1-2 |
DOIs | |
State | Published - 1 Mar 2003 |
Keywords
- Interior point method
- LPABO
- LPAKO
- Linear programming
- Simplex method