Description: Netlib LP problem ship08s: minimize c'*x, where Ax=b, lo<=x<=hi
|(bipartite graph drawing)|
|number of rows||778|
|number of columns||2,467|
|structural full rank?||no|
|# of blocks from dmperm||298|
|# strongly connected comp.||67|
|explicit zero entries||0|
|nonzero pattern symmetry||0%|
|numeric value symmetry||0%|
|kind||linear programming problem|
|Additional fields||size and type|
A Netlib LP problem, in lp/data. For more information send email to firstname.lastname@example.org with the message: send index from lp send readme from lp/data The following are relevant excerpts from lp/data/readme (by David M. Gay): The column and nonzero counts in the PROBLEM SUMMARY TABLE below exclude slack and surplus columns and the right-hand side vector, but include the cost row. We have omitted other free rows and all but the first right-hand side vector, as noted below. The byte count is for the MPS compressed file; it includes a newline character at the end of each line. These files start with a blank initial line intended to prevent mail programs from discarding any of the data. The BR column indicates whether a problem has bounds or ranges: B stands for "has bounds", R for "has ranges". The optimal value is from MINOS version 5.3 (of Sept. 1988) running on a VAX with default options. PROBLEM SUMMARY TABLE Name Rows Cols Nonzeros Bytes BR Optimal Value SHIP08S 779 2387 9501 70093 1.9200982105E+06 Supplied by Bob Fourer. When included in Netlib: Extra free rows omitted. Source: consulting.
|nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD||64,508|
|nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD||6,022|
|null space dimension||66|
|full numerical rank?||no|
|singular value gap||7.72183e+12|
|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.