bandm Peculiarities, such as lots of duplicate rows and columns, split free variables, how degenerate it is, lots of row singletons, free column singletons (i.e. stuff that can be preprocessed out of the model). Near-infeasibility, etc.
Do the major algorithms/implementations have particular difficulties with this problem.
Pointers to AMPL model and data files.
Pointers to MPS files.
Dimensions of the problem in MPS formulation: 306 rows, 472 columns, 2659 nonzeros.
The optimal objective value as determined by CPLEX 3.0 is
Click on this entry to see the complete list of primal and dual values obtained from the NEOS LP solver.
More discussion of the problems, and the performance of simplex and interior-point algorithms on it.
[ Previous problem | Netlib toplevel index | Next problem]
[ Optimization Software Guide | OTC Home Page | NEOS Server | NEOS Guide ]