LPnetlib/lp_cycle

Netlib LP problem cycle: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_cycle
Group LPnetlib
Matrix ID 613
Num Rows 1,903
Num Cols 3,371
Nonzeros 21,234
Pattern Entries 21,234
Kind Linear Programming Problem
Symmetric No
Date 1989
Author J. Tomlin
Editor D. Gay
Structural Rank 1,875
Structural Rank Full false
Num Dmperm Blocks 98
Strongly Connect Components 29
Num Explicit Zeros 0
Pattern Symmetry 0%
Numeric Symmetry 0%
Cholesky Candidate no
Positive Definite no
Type real
SVD Statistics
Matrix Norm 2.018626e+03
Minimum Singular Value 2.241252e-17
Condition Number 9.006686e+19
Rank 1,875
sprank(A)-rank(A) 0
Null Space Dimension 28
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 BOUND-TYPE TABLE below shows the bound types       
present in those problems that have bounds.                               
                                                                          
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         
CYCLE      1904   2857    21322     166648  B    -5.2263930249E+00        
                                                                          
        BOUND-TYPE TABLE                                                  
CYCLE      UP       FR                                                    
                                                                          
Empty RHS section.                                                        
                                                                          
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                                       
     CYCLE     3156   1485   47.05                                        
                                                                          
Added to Netlib on 27 June 1989