|HOPDM||Extended Name||High Order Primal Dual Method|
Department of Mathematics and Statistics
The University of Edinburgh
James Clerk Maxwell Building
Edinburgh EH9 3JZ, U.K.
Fax No: +44 131 650 6553
|Version||2.13 for LP|
|Modeling Languages link||AMPL|
|Remarks||HOPDM is a package for solving large scale linear and convex quadratic programming problems. The code is an implementation of the infeasible primal-dual interior point method. It uses multiple centrality correctors; their number is chosen appropriately for a given problem in order to reduce the overall solution time. HOPDM automatically chooses the most appropriate factorization method for a given problem (either normal equations or augmented system).
You can see general information about HOPDM and get HOPDM F77 source code (version 2.13, free of charge).
A comparison between HOPDM and some other IP package for LP is given in Hans Mittelmann (email@example.com) benchmark: