LPnetlib/lp_scsd6
Netlib LP problem scsd6: minimize c'*x, where Ax=b, lo<=x<=hi
Name 
lp_scsd6 
Group 
LPnetlib 
Matrix ID 
676 
Num Rows

147 
Num Cols

1,350 
Nonzeros

4,316 
Pattern Entries

4,316 
Kind

Linear Programming Problem 
Symmetric

No 
Date

1981 
Author

J. Ho, E. Loute 
Editor

R. Fourer 
Structural Rank 
147 
Structural Rank Full 
true 
Num Dmperm Blocks

1 
Strongly Connect Components

1 
Num Explicit Zeros

0 
Pattern Symmetry

0% 
Numeric Symmetry

0% 
Cholesky Candidate

no 
Positive Definite

no 
Type

real 
SVD Statistics 
Matrix Norm 
6.050443e+00 
Minimum Singular Value 
6.837952e02 
Condition Number 
8.848325e+01

Rank 
147 
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 righthand side vector, but include
the cost row. We have omitted other free rows and all but the first
righthand 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
SCSD6 148 1350 5666 32161 5.0500000078E+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. 245250.
Bob Bixby reports that the CPLEX solver (running on a Sparc station)
finds slightly different optimal values for some of the problems.
On a MIPS processor, MINOS version 5.3 (with crash and scaling of
December 1989) also finds different optimal values for some of the
problems. The following table shows the values that differ from those
shown above. (Whether CPLEX finds different values on the recently
added problems remains to be seen.)
Problem CPLEX(Sparc) MINOS(MIPS)
SCSD6 5.0500000077E+01
