Matrix properties
number of rows	2,030
number of columns	6,680
nonzeros	74,949
structural full rank?	yes
structural rank	2,030
# of blocks from dmperm	2
# strongly connected comp.	2
explicit zero entries	0
nonzero pattern symmetry	0%
numeric value symmetry	0%
type	real
structure	rectangular
Cholesky candidate?	no
positive definite?	no

author	J. Stone
editor	I. Lustig
date	1990
kind	linear programming problem
2D/3D problem?	no

Additional fields	size and type
b	full 2030-by-1
c	full 6680-by-1
lo	full 6680-by-1
hi	full 6680-by-1
z0	full 1-by-1

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 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          
PILOT87    2031   4883    73804     514192  B     3.0171072827E+02         
                                                                           
Supplied by Irv Lustig, which he obtained from John Stone.                 
When included in Netlib: Extra free rows 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)                           
PILOT87                           3.0171074161E+02                         
                                                                           
Added to Netlib on  15 June 1990.                                          
Modified, in Netlib, on  21 Oct. 1991 (minor cleanups): removed lower bound
of 49.5 on U[OG]ST0[12], which are subsequently fixed at 99 (UOST[12]) or  
65.4.                                                                      
                                                                           

Ordering statistics:	result
nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD	3,438,865
nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD	422,518

SVD-based statistics:
norm(A)	1004.46
min(svd(A))	0.123198
cond(A)	8153.26
rank(A)	2,030
sprank(A)-rank(A)	0
null space dimension	0
full numerical rank?	yes

singular values (MAT file):	click here
SVD method used:	s = svd (full (A)) ;
status:	ok

For a description of the statistics displayed above, click here.

Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.