Matrix: LPnetlib/lp_sctap2
Description: Netlib LP problem sctap2: minimize c'*x, where Ax=b, lo<=x<=hi
(bipartite graph drawing) |
Matrix properties | |
number of rows | 1,090 |
number of columns | 2,500 |
nonzeros | 7,334 |
structural full rank? | yes |
structural rank | 1,090 |
# of blocks from dmperm | 1 |
# strongly connected comp. | 1 |
explicit zero entries | 0 |
nonzero pattern symmetry | 0% |
numeric value symmetry | 0% |
type | integer |
structure | rectangular |
Cholesky candidate? | no |
positive definite? | no |
author | J. Ho, E. Loute |
editor | R. Fourer |
date | 1981 |
kind | linear programming problem |
2D/3D problem? | no |
Additional fields | size and type |
b | full 1090-by-1 |
c | full 2500-by-1 |
lo | full 2500-by-1 |
hi | full 2500-by-1 |
z0 | full 1-by-1 |
Notes:
A Netlib LP problem, in lp/data. For more information send email to netlib@ornl.gov 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 SCTAP2 1091 1880 8124 57479 1.7248071429E+03 Supplied by Bob Fourer. When included in Netlib: Extra free rows omitted. Source: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming Test Problems", Math. Prog. 20 (1981), pp. 245-250.
Ordering statistics: | result |
nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 157,175 |
nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 14,937 |
SVD-based statistics: | |
norm(A) | 184.408 |
min(svd(A)) | 1 |
cond(A) | 184.408 |
rank(A) | 1,090 |
sprank(A)-rank(A) | 0 |
null space dimension | 0 |
full numerical rank? | yes |
singular values (MAT file): | click here |
SVD method used: | s = svd (full (A)) ; |
status: | ok |
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.