LPnetlib/lp_ken_07

Netlib LP problem ken_07: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_ken_07
Group LPnetlib
Matrix ID 637
Num Rows 2,426
Num Cols 3,602
Nonzeros 8,404
Pattern Entries 8,404
Kind Linear Programming Problem
Symmetric No
Date 1991
Author J. Kennington
Editor D. Gay
Structural Rank 2,426
Structural Rank Full true
Num Dmperm Blocks 990
Strongly Connect Components 1
Num Explicit Zeros 0
Pattern Symmetry 0%
Numeric Symmetry 0%
Cholesky Candidate no
Positive Definite no
Type integer
SVD Statistics
Matrix Norm 7.524098e+00
Minimum Singular Value 1.156971e-15
Condition Number 6.503274e+15
Rank 2,377
sprank(A)-rank(A) 49
Null Space Dimension 49
Full Numerical Rank? no
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
Notes
A Netlib LP problem, in lp/data/kennington.  For more information             
send email to netlib@ornl.gov with the message:                               
                                                                              
	 send index from lp                                                          
	 send readme from lp/data                                                    
	 send readme from lp/data/kennington                                         
                                                                              
The following are relevant excerpts from lp/data/kennington/readme:           
                                                                              
The "Kennington" problems: sixteen problems described in "An Empirical        
Evaluation of the KORBX Algorithms for Military Airlift Applications"         
by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J.               
Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).            
                                                                              
The following table gives some statistics for the "Kennington"                
problems.  The number of columns excludes slacks and surpluses.               
The bounds column tells how many entries appear in the BOUNDS                 
section of the MPS file.  The mpc column shows the bytes in                   
the problem after "uncompress" and before "emps"; MPS shows                   
the bytes after "emps".  The optimal values were computed by                  
Vanderbei's ALPO, running on an SGI computer (with binary IEEE                
arithmetic).                                                                  
                                                                              
Name       rows  columns  nonzeros  bounds      mpc      MPS     optimal value
KEN-07     2427    3602     11981     7204    150525    718748  -6.7952044e+08
                                                                              
Submitted to Netlib by Irv Lustig.