The BPMPD solver is is a state-of-the-art FORTRAN implementation of the
primal-dual interior point algorithm. 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. BPMPD accepts the standard MPS format, but
it can also be used as a callable library.
BPMPD was written by
of the Laboratory of Operations Research and Decision Systems,
To learn more about BPMPD, click the above link "bpmpd".
This solver was implemented by
Hans Mittelmann and executes at
To look at our collection of test problems for continuous
linear programming (converted to AMPL from the Netlib collection), click
You can take the NEOS Server for BPMPD on a trial run by
submitting some ready-made data! Click on the
"Sample Submission" link above for details.
Using the NEOS Server for BPMPD (AMPL input)
To solve a linear programming problem, the user must submit a model in
Examples of models in AMPL format can be found in the
netlib collection. When submitting via e-mail or XML-RPC then
delete empty tokens!
The model is specified by a model file, and optionally,
a data file, and a commands file.
If the command file is specified it must contain
the AMPL solve command.
The commands file can contain any AMPL command or set options for BPMPD
by modifying the variable 'bpmpd_options'. See
a listing of the various options.
Enter the complete path to the AMPL model file
Enter the complete path to the AMPL data file
Enter the complete path to the AMPL command file
Dry run: generate job XML instead of submitting it to NEOS
Short Priority: submit to higher priority queue with maximum CPU time of 5
Please do not click the 'Submit to NEOS' button more than once.