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

330 
Num Cols

600 
Nonzeros

2,732 
Pattern Entries

2,732 
Kind

Linear Programming Problem 
Symmetric

No 
Date

1981 
Author

J. Ho, E. Loute 
Editor

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

9 
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 
1.014140e+03 
Minimum Singular Value 
4.196284e02 
Condition Number 
2.416757e+04

Rank 
330 
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
SCFXM1 331 457 2612 19078 1.8416759028E+04
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.
