LPAKO is a public domain simplex-based linear programming program which can solve large-scale, sparse linear programming problems. It has been widely used in many applications and shows better performance than other public domain simplex-based programs. Several aspects considered in the development of LPAKO are described in this article such as the construction of initial basis, $LU$ factorization of basis matrix, pricing rule, presolving/postsolving and other miscellaneous issues. At the end of the article, we introduce H. Mittelman’s benchmark result which compares the performance of LPAKO with those of several simplex-based programs. We also compare LPAKO with CPLEX on the NETLIB test set.
Keywords for this software
References in zbMATH (referenced in 3 articles , 1 standard article )
Showing results 1 to 3 of 3.
- Bentobache, Mohand; Bibi, Mohand Ouamer: A two-phase support method for solving linear programs: numerical experiments (2012)
- Kim, Woo-Je; Lim, Sungmook; Doh, Seung-yong; Park, Soondal; Ahn, Jaegeun: Numerical aspects in developing LP softwares, LPAKO and LPABO (2003)
- Lim, Sungmook; Park, Soondal: LPAKO: A simplex-based linear programming program (2002)