LPnetlib/lp_sc205
Netlib LP problem sc205: minimize c'*x, where Ax=b, lo<=x<=hi
| Name |
lp_sc205 |
| Group |
LPnetlib |
| Matrix ID |
665 |
|
Num Rows
|
205 |
|
Num Cols
|
317 |
|
Nonzeros
|
665 |
|
Pattern Entries
|
665 |
|
Kind
|
Linear Programming Problem |
|
Symmetric
|
No |
|
Date
|
|
|
Author
|
J. Ho, E. Loute |
|
Editor
|
R. Fourer |
| Structural Rank |
205 |
| Structural Rank Full |
true |
|
Num Dmperm Blocks
|
3 |
|
Strongly Connect Components
|
3 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
0% |
|
Numeric Symmetry
|
0% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
real |
| SVD Statistics |
| Matrix Norm |
4.100817e+00 |
| Minimum Singular Value |
3.247693e-02 |
| Condition Number |
1.262686e+02
|
| Rank |
205 |
| sprank(A)-rank(A) |
0 |
| Null Space Dimension |
0 |
| Full Numerical Rank? |
yes |
| Download Singular Values |
MATLAB
|
| Download |
MATLAB
Rutherford Boeing
Matrix Market
|
| 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
SC205 206 203 552 6380 -5.2202061212E+01
Supplied by Bob Fourer.
Source: J.K. Ho and E. Loute, "A Set of Staircase Linear Programming
Test Problems", Math. Prog. 20 (1981), pp. 245-250.
|
