Matrix: LPnetlib/lp_cre_b

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

LPnetlib/lp_cre_b graph
(bipartite graph drawing)


LPnetlib/lp_cre_b dmperm of LPnetlib/lp_cre_b
scc of LPnetlib/lp_cre_b

  • 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: 356 KB. Use UFget(610) or UFget('LPnetlib/lp_cre_b') in MATLAB.
  • download in Matrix Market format, file size: 709 KB.
  • download in Rutherford/Boeing format, file size: 479 KB.

    Matrix properties
    number of rows9,648
    number of columns77,137
    nonzeros260,785
    structural full rank?no
    structural rank7,240
    # of blocks from dmperm6
    # strongly connected comp.2,409
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    typereal
    structurerectangular
    Cholesky candidate?no
    positive definite?no

    authorJ. Kennington
    editorI. Lustig
    date1990
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 9648-by-1
    cfull 77137-by-1
    lofull 77137-by-1
    hifull 77137-by-1
    z0full 1-by-1

    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.                                            
                                                                                  
    

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD50,282,525
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD775,335

    SVD-based statistics:
    norm(A)193.15
    min(svd(A))0
    cond(A)Inf
    rank(A)7,232
    sprank(A)-rank(A)8
    null space dimension2,416
    full numerical rank?no
    singular value gap1.83934e+13

    singular values (MAT file):click here
    SVD method used:s = svd (full (R)) ; where [~,R,E] = spqr (A') with droptol of zero
    status:ok

    LPnetlib/lp_cre_b 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.