bpmpd

The BPMPD LP/QP solver is is a state-of-the-art implementation of the primal-dual interior point algorithm for linar and convex quadratic problems. The main features of the package are the highly flexible sparsity handling (including minimum local fill-in ordering and augmented system formulation), fast and robust linear algebra (based on supernodal elimination) and advanced presolve techniques. This implementation of BPMPD-2.21 accepts this LP format, strict MPS format, and for QPs this QPS format.
See these notes on formats and conversion.

BPMPD was written by Csaba Mészáros of the Laboratory of Operations Research and Decision Systems, Budapest, Hungary. For further information, visit the BPMPD home page. While sources of this version are not available there are Unix/Linux libraries here, binaries here, and a Matlab version here.

This solver was implemented by Hans Mittelmann and executes at under

Using the NEOS Server for BPMPD

The user must submit an LP or convex QP problem in one of the formats given above.
It is absolutely crucial that NO NAMES ARE LONGER THAN 8 CHARACTERS!. See also the sample submission problems. When submitting via e-mail or XML-RPC delete empty tokens!
Do not submit in the wrong window!

Enter the complete path to the LP (not CPLEX) format file. Names should not be longer than 8 characters!
BPMPD data (LP format file):

Alternatively, enter the complete path to the MPS format file. Names should not be longer than 8 characters!
BPMPD data (MPS format file):

Alternatively, enter the complete path to the QPS format file. Names should not be longer than 8 characters!
BPMPD data (QPS format file):

Comments:

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}