LPnetlib/lp_degen3
Netlib LP problem degen3: minimize c'*x, where Ax=b, lo<=x<=hi
| Name | lp_degen3 | 
| Group | LPnetlib | 
| Matrix ID | 618 | 
| Num Rows | 1,503 | 
| Num Cols | 2,604 | 
| Nonzeros | 25,432 | 
| Pattern Entries | 25,432 | 
| Kind | Linear Programming Problem | 
| Symmetric | No | 
| Date | 1989 | 
| Author | J. Tomlin | 
| Editor | D. Gay | 
 
 
| Structural Rank | 1,503 | 
| 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 | integer | 
 
| SVD Statistics | 
| Matrix Norm | 5.465095e+01 | 
| Minimum Singular Value | 1.006630e-14 | 
| Condition Number | 5.429098e+15 | 
| Rank | 1,501 | 
| sprank(A)-rank(A) | 2 | 
| Null Space Dimension | 2 | 
| Full Numerical Rank? | no | 
| Download Singular Values | MATLAB | 
 
 
| Download | MATLAB
Rutherford Boeing
Matrix Market | 
| 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 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         
DEGEN3     1504   1818    26230     130252       -9.8729400000E+02        
                                                                          
From John Tomlin.                                                         
On the problems supplied by John Tomlin, MINOS 5.3 reports that about     
10% to 57% of its steps are degenerate:                                   
     Name     Steps  Degen  Percent                                       
     DEGEN3    6283   3299   52.51                                        
                                                                          
When included in Netlib: Cost coefficients negated.                       
                                                                          
Added to Netlib on  30 Oct. 1989 |