Description: Netlib LP problem pilot4i: minimize c'*x, where Ax=b, lo<=x<=hi
|(bipartite graph drawing)|
|number of rows||410|
|number of columns||1,123|
|structural full rank?||yes|
|# of blocks from dmperm||9|
|# strongly connected comp.||1|
|explicit zero entries||0|
|nonzero pattern symmetry||0%|
|numeric value symmetry||0%|
|kind||linear programming problem|
|Additional fields||size and type|
An infeasible Netlib LP problem, in lp/infeas. For more information send email to firstname.lastname@example.org with the message: send index from lp send readme from lp/data send readme from lp/infeas The lp/infeas directory contains infeasible linear programming test problems collected by John W. Chinneck, Carleton Univ, Ontario Canada. The following are relevant excerpts from lp/infeas/readme (by John W. Chinneck): In the following, IIS stands for Irreducible Infeasible Subsystem, a set of constraints which is itself infeasible, but becomes feasible when any one member is removed. Isolating an IIS from within the larger set of constraints defining the model is one analysis approach. PROBLEM DESCRIPTION ------------------- PILOT4I: medium size problem generated by doctoring the original NETLIB PILOT4 model. Contributor: John Stone, Ketron Management Science. Name Rows Cols Nonzeros Bounds Notes pilot4i 411 1000 5145 B FR FX Added to Netlib on Sept. 19, 1993
|nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD||88,693|
|nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD||14,742|
|null space dimension||0|
|full numerical rank?||yes|
|singular values (MAT file):||click here|
|SVD method used:||s = svd (full (A)) ;|
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.