LPnetlib/lp_pds_20

Netlib LP problem pds_20: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_pds_20
Group LPnetlib
Matrix ID 652
Num Rows 33,874
Num Cols 108,175
Nonzeros 232,647
Pattern Entries 232,647
Kind Linear Programming Problem
Symmetric No
Date 1990
Author J. Kennington
Editor I. Lustig
Structural Rank 33,798
Structural Rank Full false
Num Dmperm Blocks 853
Strongly Connect Components 77
Num Explicit Zeros 0
Pattern Symmetry 0%
Numeric Symmetry 0%
Cholesky Candidate no
Positive Definite no
Type integer
SVD Statistics
Matrix Norm 9.854167e+00
Minimum Singular Value 0
Condition Number Inf
Rank 33,787
sprank(A)-rank(A) 11
Null Space Dimension 87
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
PDS-20    33875  105728    304153    34888   2856653  11550890   2.3821659e+10
                                                                              
Submitted to Netlib by Irv Lustig.