Netlib LP problem 80bau3b: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_80bau3b
Group LPnetlib
Matrix ID 595
Num Rows 2,262
Num Cols 12,061
Nonzeros 23,264
Pattern Entries 23,264
Kind Linear Programming Problem
Symmetric No
Author W. Kurator, H. Greenberg
Editor R. Fourer
Structural Rank 2,262
Structural Rank Full true
Num Dmperm Blocks 26
Strongly Connect Components 154
Num Explicit Zeros 0
Pattern Symmetry 0%
Numeric Symmetry 0%
Cholesky Candidate no
Positive Definite no
Type real
SVD Statistics
Matrix Norm 5.672253e+02
Minimum Singular Value 1.000000e+00
Condition Number 5.672253e+02
Rank 2,262
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         
80BAU3B    2263   9799    29063     298952  B     9.8723216072E+05        
        BOUND-TYPE TABLE                                                  
80BAU3B    UP LO FX                                                       
Supplied by Bob Fourer.                                                   
When included in Netlib: Extra free rows omitted.                         
Source: W. Kurator and Harvey Greenberg, Energy Information               
Administration (Greenberg is now at the Univ. of Colorado - Denver).      
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)                          
80BAU3B      9.8722419241E+05     9.8722952818E+05