LPnetlib/lp_wood1p

Netlib LP problem wood1p: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_wood1p
Group LPnetlib
Matrix ID 701
Num Rows 244
Num Cols 2,595
Nonzeros 70,216
Pattern Entries 70,216
Kind Linear Programming Problem
Symmetric No
Date 1989
Author J. Tomlin
Editor D. Gay
Structural Rank 244
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.273116e+04
Minimum Singular Value 1.711938e-10
Condition Number 1.327803e+14
Rank 243
sprank(A)-rank(A) 1
Null Space Dimension 1
Full Numerical Rank? no
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         
WOOD1P      245   2594    70216     328905        1.4429024116E+00        
                                                                          
From John Tomlin.                                                         
On the problems supplied by John Tomlin, MINOS 5.3 reports that about     
10% to 57% of its steps are degenerate:                                   
     Name     Steps  Degen  Percent                                       
     WOOD1P    1059    471   44.48                                        
                                                                          
Added to Netlib on  27 June 1989