HOPDM (version 2.12) — A fast LP solver based on a primal-dual interior point method
- 1 August 1995
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 85 (1), 221-225
- https://doi.org/10.1016/0377-2217(95)00163-k
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- QHOPDM — A higher order primal-dual method for large scale convex quadratic programmingEuropean Journal of Operational Research, 1995
- Commentary—Progress in Linear ProgrammingINFORMS Journal on Computing, 1994
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the ArtINFORMS Journal on Computing, 1994
- Long-term strategies for mitigating global warmingEnergy, 1993
- HOPDM — A higher order primal-dual method for large scale linear programmingEuropean Journal of Operational Research, 1993
- Implementing cholesky factorization for interior point methods of linear programmingOptimization, 1993
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming 1 1The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Place du Marechal de Lattre de Tassigny, 75775 Paris Cedex 16, France$ef: 2 2A preliminary version of the paper has been presented at the Applied Mathematical Programming and Modelling Symposium APMOD’91 in London, January 14-16, 1991$ef:Optimization, 1992