%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lp_pilot87
% name: LPnetlib/lp_pilot87
% [Netlib LP problem pilot87: minimize c'*x, where Ax=b, lo<=x<=hi]
% id: 656
% date: 1990
% author: J. Stone
% ed: I. Lustig
% fields: title name A b id aux kind date author ed notes
% aux: c lo hi z0
% kind: linear programming problem
%-------------------------------------------------------------------------------
% 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.                                                                      
%                                                                            
%-------------------------------------------------------------------------------
