LPnetlib/lp_cre_b

Netlib LP problem cre_b: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_cre_b
Group LPnetlib
Matrix ID 610
Num Rows 9,648
Num Cols 77,137
Nonzeros 260,785
Pattern Entries 260,785
Kind Linear Programming Problem
Symmetric No
Date 1990
Author J. Kennington
Editor I. Lustig
Structural Rank 7,240
Structural Rank Full false
Num Dmperm Blocks 6
Strongly Connect Components 2,409
Num Explicit Zeros 0
Pattern Symmetry 0%
Numeric Symmetry 0%
Cholesky Candidate no
Positive Definite no
Type real
SVD Statistics
Matrix Norm 1.931495e+02
Minimum Singular Value 0
Condition Number Inf
Rank 7,232
sprank(A)-rank(A) 8
Null Space Dimension 2,416
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
CRE-B      9649   72447    328542        0   2119719  10478735   2.3129640e+07
                                                                              
Submitted to Netlib by Irv Lustig.