Meszaros/pf2177
linear programming problem, C. Meszaros test set
Name |
pf2177 |
Group |
Meszaros |
Matrix ID |
1753 |
Num Rows
|
9,728 |
Num Cols
|
10,178 |
Nonzeros
|
30,984 |
Pattern Entries
|
30,984 |
Kind
|
Linear Programming Problem |
Symmetric
|
No |
Date
|
2004 |
Author
|
|
Editor
|
C. Meszaros |
Structural Rank |
9,728 |
Structural Rank Full |
true |
Num Dmperm Blocks
|
1 |
Strongly Connect Components
|
271 |
Num Explicit Zeros
|
0 |
Pattern Symmetry
|
0% |
Numeric Symmetry
|
0% |
Cholesky Candidate
|
no |
Positive Definite
|
no |
Type
|
binary |
SVD Statistics |
Matrix Norm |
9.751310e+00 |
Minimum Singular Value |
9.670723e-16 |
Condition Number |
1.008333e+16
|
Rank |
9,662 |
sprank(A)-rank(A) |
66 |
Null Space Dimension |
66 |
Full Numerical Rank? |
no |
Download Singular Values |
MATLAB
|
Download |
MATLAB
Rutherford Boeing
Matrix Market
|
Notes |
http://www.sztaki.hu/~meszaros/public_ftp/lptestset
Converted to standard form via Resende and Veiga's mpsrd:
minimize c'*x, subject to A*x=b and lo <= x <= hi
|