Matrix: LPnetlib/lp_cycle

Description: Netlib LP problem cycle: minimize c'*x, where Ax=b, lo<=x<=hi

LPnetlib/lp_cycle graph
(bipartite graph drawing)

LPnetlib/lp_cycle dmperm of LPnetlib/lp_cycle
scc of LPnetlib/lp_cycle

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: LPnetlib
  • Click here for a description of the LPnetlib group.
  • Click here for a list of all matrices
  • Click here for a list of all matrix groups
  • download as a MATLAB mat-file, file size: 96 KB. Use UFget(613) or UFget('LPnetlib/lp_cycle') in MATLAB.
  • download in Matrix Market format, file size: 105 KB.
  • download in Rutherford/Boeing format, file size: 82 KB.

    Matrix properties
    number of rows1,903
    number of columns3,371
    structural full rank?no
    structural rank1,875
    # of blocks from dmperm98
    # strongly connected comp.29
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

    authorJ. Tomlin
    editorD. Gay
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 1903-by-1
    cfull 3371-by-1
    lofull 3371-by-1
    hifull 3371-by-1
    z0full 1-by-1


    A Netlib LP problem, in lp/data.  For more information                    
    send email to 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                                           

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD395,322
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD92,074

    SVD-based statistics:
    null space dimension28
    full numerical rank?no
    singular value gap3.49328e+09

    singular values (MAT file):click here
    SVD method used:s = svd (full (A)) ;

    LPnetlib/lp_cycle svd

    For a description of the statistics displayed above, click here.

    Maintained by Tim Davis, last updated 12-Mar-2014.
    Matrix pictures by cspy, a MATLAB function in the CSparse package.
    Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.