LPnetlib/lp_osa_30
Netlib LP problem osa_30: minimize c'*x, where Ax=b, lo<=x<=hi
| Name | lp_osa_30 | 
| Group | LPnetlib | 
| Matrix ID | 647 | 
| Num Rows | 4,350 | 
| Num Cols | 104,374 | 
| Nonzeros | 604,488 | 
| Pattern Entries | 604,488 | 
| Kind | Linear Programming Problem | 
| Symmetric | No | 
| Date | 1990 | 
| Author | J. Kennington | 
| Editor | I. Lustig | 
 
 
| Structural Rank | 4,350 | 
| Structural Rank Full | true | 
| Num Dmperm Blocks | 1 | 
| 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 | 1.365894e+03 | 
| Minimum Singular Value | 1.000000e+00 | 
| Condition Number | 1.365894e+03 | 
| Rank | 4,350 | 
| sprank(A)-rank(A) | 0 | 
| Null Space Dimension | 0 | 
| Full Numerical Rank? | yes | 
| 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
OSA-30     4351  100024    700160        0   4470876  22495351   2.1421399e+06
                                                                              
Submitted to Netlib by Irv Lustig. |