Matrix: LPnetlib/lp_ken_07

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

LPnetlib/lp_ken_07 graph
(bipartite graph drawing)

LPnetlib/lp_ken_07 dmperm of LPnetlib/lp_ken_07

  • 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: 34 KB. Use UFget(637) or UFget('LPnetlib/lp_ken_07') in MATLAB.
  • download in Matrix Market format, file size: 48 KB.
  • download in Rutherford/Boeing format, file size: 42 KB.

    Matrix properties
    number of rows2,426
    number of columns3,602
    structural full rank?yes
    structural rank2,426
    # of blocks from dmperm990
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

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

    Additional fieldssize and type
    bfull 2426-by-1
    cfull 3602-by-1
    lofull 3602-by-1
    hifull 3602-by-1
    z0full 1-by-1


    A Netlib LP problem, in lp/data/kennington.  For more information             
    send email to 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
    KEN-07     2427    3602     11981     7204    150525    718748  -6.7952044e+08
    Submitted to Netlib by Irv Lustig.                                            

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD67,547
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD15,529

    SVD-based statistics:
    null space dimension49
    full numerical rank?no
    singular value gap4.57137e+12

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

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