National Institute for Research and Development in Informatics, ICI – Bucharest
Bucharest Academy of Romanian Scientists
Abstract: In this paper we present the numerical performances of MINOS and HOPDM packages for solving linear programming problems. MINOS implements the simplex algorithm with LU factorization of the basis, and HOPDM uses the predictor-corrector interior-point algorithm. The comparison considers a number of linear programming problems from different collections.
Keywords: Linear programming, MINOS, HOPDM, numerical comparisons.
CITE THIS PAPER AS:
Neculai Andrei, Numerical study. Comparison MINOS versus HOPDM for linear programming solving, Romanian Journal of Information Technology and Automatic Control, ISSN 1220-1758, vol. 20(3), pp. 67-78, 2010.