Netlib LP problem sierra: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_sierra
Group LPnetlib
Matrix ID 690
Num Rows 1,227
Num Cols 2,735
Nonzeros 8,001
Pattern Entries 8,001
Kind Linear Programming Problem
Symmetric No
Author R. Helgason, J. Kennington, P. Wong
Editor R. Fourer
Structural Rank 1,227
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 integer
SVD Statistics
Matrix Norm 1.000000e+05
Minimum Singular Value 3.378598e-15
Condition Number 2.959807e+19
Rank 1,217
sprank(A)-rank(A) 10
Null Space Dimension 10
Full Numerical Rank? no
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
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 BOUND-TYPE TABLE below shows the bound types       
present in those problems that have bounds.                               
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         
SIERRA     1228   2036     9252      76627  B     1.5394362184E+07        
        BOUND-TYPE TABLE                                                  
SIERRA     UP                                                             
Supplied by Bob Fourer.                                                   
When included in Netlib: Explicit zeros omitted.                          
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)                          
SIERRA                            1.5394364186E+07                        
Source: GFRD-PNC, SIERRA: R. Helgason, J. Kennington, and P. Wong,        
"An Application of Network Programming for National Forest Planning",     
Technical Report OR 81006, Dept. of Operations Research, Southern         
Methodist University.