Meszaros/gams10am
Infeasible linear programming problem, C. Meszaros test set
| Name |
gams10am |
| Group |
Meszaros |
| Matrix ID |
1675 |
|
Num Rows
|
114 |
|
Num Cols
|
171 |
|
Nonzeros
|
407 |
|
Pattern Entries
|
407 |
|
Kind
|
Linear Programming Problem |
|
Symmetric
|
No |
|
Date
|
2004 |
|
Author
|
|
|
Editor
|
C. Meszaros |
| Structural Rank |
114 |
| Structural Rank Full |
true |
|
Num Dmperm Blocks
|
2 |
|
Strongly Connect Components
|
4 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
0% |
|
Numeric Symmetry
|
0% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
real |
| SVD Statistics |
| Matrix Norm |
2.967192e+00 |
| Minimum Singular Value |
1.000000e+00 |
| Condition Number |
2.967192e+00
|
| Rank |
114 |
| sprank(A)-rank(A) |
0 |
| Null Space Dimension |
0 |
| Full Numerical Rank? |
yes |
| 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
|
