LPINT: LP Software Based on the Interior Point Method
Karmarkar’s algorithm (Karmarkar 1984) and other interior point methods are now regarded as a competitive methods for solving linear programming (LP) problems. It is therefore worth-while to undertake development of a professional LP software based on some particular interior point method. We describe design and implementation aspects of LPINT, an LP software package which is based on the primal-dual interior point algorithm.
- Duff I.S., Erisman A.M., Reid J.K. (1989) Direct Methods for Sparse Matrices. Clarendon Press. OxfordGoogle Scholar
- Gay D.M. (1985) Electronic Mail Distribution of Linear Programming Test Problems. Mathematical Programming Society COAL Newsletter 13: 10–12Google Scholar
- George J.A., Liu J.W. (1981) Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall. Englewood CliffsGoogle Scholar