Netlib LP problem pilot4: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_pilot4
Group LPnetlib
Matrix ID 655
Num Rows 410
Num Cols 1,123
Nonzeros 5,264
Pattern Entries 5,264
Kind Linear Programming Problem
Symmetric No
Author Stanford
Editor R. Fourer
Structural Rank 410
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 5.935540e+04
Minimum Singular Value 1.405396e-01
Condition Number 4.223392e+05
Rank 410
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         
PILOT4      411   1000     5145      40936  B    -2.5811392641E+03        
        BOUND-TYPE TABLE                                                  
PILOT4     UP    FX FR PL                                                 
Supplied by Bob Fourer.                                                   
When included in Netlib: Cost coefficients unchanged (PILOT4 appeared     
to be a minimization problem already).                                    
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)                          
PILOT4      -2.5811392589E+03    -2.5811392624E+03                        
Source for PILOT.JA, PILOT.WE, PILOT4, PILOTNOV: Systems Optimization     
Laboratory, Stanford University.