NETLIB LP
Test Problems
This area contains the netlib test set for linear programming. We include
- Input files for each problem ( MPS format)
- AMPL model and data files for the SCSD problems
- The underlying application
- Peculiarities of each problem: redundancies in the formulation, degeneracy, features
that may cause difficulties for some solvers.
- Optimal objective values and solutions.
We don't have complete information about many of the problems. If you know something we
don't know, please drop us a line.
As on the netlib repository, we partition the problems into three sets:
- The standard test set, all of which have primal-dual solutions
- The infeasible test set, for which there are of course no solutions (your
super-duper code should of course diagnose infeasibility)
- The Kennington problems, which is a set of 20 or so large problems arising from
Military Aircraft Applications.
The Standard Netlib Problems
README file for Netlib problems
The Infeasible Netlib Problems
The Kennington Problems
[ OTC Home Page | NEOS Server | NEOS Guide | comments ]