Netlib LP problem grow7: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_grow7
Group LPnetlib
Matrix ID 634
Num Rows 140
Num Cols 301
Nonzeros 2,612
Pattern Entries 2,612
Kind Linear Programming Problem
Symmetric No
Date 1983
Author R. Fourer
Editor R. Fourer
Structural Rank 140
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 2.483570e+00
Minimum Singular Value 4.797452e-01
Condition Number 5.176853e+00
Rank 140
sprank(A)-rank(A) 0
Null Space Dimension 0
Full Numerical Rank? yes
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         
GROW7       141    301     2633      17043  B    -4.7787811815E+07        
        BOUND-TYPE TABLE                                                  
GROW7      UP                                                             
Supplied by Bob Fourer.                                                   
When included in Netlib: Extra bound sets omitted; explicit zeros         
omitted; cost coefficients negated.                                       
Source:   GROW15, GROW22, GROW7: R. Fourer, "Solving Staircase Linear     
Programs by the Simplex Method, 2: Pricing", Math. Prog. 25 (1983),       
pp. 251-292.