• SJSU Singular Matrix Database
  • 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

  • Matrix: LPnetlib/lp_cre_c
  • Description: Netlib LP problem cre_c: minimize c'*x, where Ax=b, lo<=x<=hi
  • download as a MATLAB mat-file, file size: 60 KB. Use SJget(345) or SJget('LPnetlib/lp_cre_c') in MATLAB.
  • download in Matrix Market format, file size: 62 KB.
  • download in Rutherford/Boeing format, file size: 53 KB.


    Routine svd from Matlab (R2008a) used to calculate the singular values.


    dmperm of LPnetlib/lp_cre_c

    scc of LPnetlib/lp_cre_c

    Matrix properties (click for a legend)  
    number of rows3,068
    number of columns6,411
    structural full rank?no
    structural rank2,986
    numerical rank 2,981
    dimension of the numerical null space3,430
    numerical rank / min(size(A))0.97164
    Euclidean norm of A 180.99
    calculated singular value # 29810.011163
    numerical rank defined using a tolerance
    max(size(A))*eps(norm(A)) =
    calculated singular value # 29821.7075e-015
    gap in the singular values at the numerical rank:
    singular value # 2981 / singular value # 2982
    calculated condition numberInf
    # of blocks from dmperm17
    # strongly connected comp.83
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

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

    Additional fieldssize and type
    bfull 3068-by-1
    cfull 6411-by-1
    lofull 6411-by-1
    hifull 6411-by-1
    z0full 1-by-1


    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                
    Name       rows  columns  nonzeros  bounds      mpc      MPS     optimal value
    CRE-C      3069    3678     16922        0    135315    587817   2.5275116e+07
    Submitted to Netlib by Irv Lustig.                                            

    Ordering statistics:AMD METIS
    nnz(V) for QR, upper bound nnz(L) for LU306,439 300,373
    nnz(R) for QR, upper bound nnz(U) for LU34,798 36,226

    Maintained by Leslie Foster, last updated 24-Apr-2009.

    Entries 5 through 14 in the table of matrix properties and the singular
    value plot were created using SJsingular code. The other plots
    and statistics are produced using utilities from the SuiteSparse package.
    Matrix color plot pictures by cspy, a MATLAB function in the CSparse package.