Matrix: LPnetlib/lpi_ceria3d

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

LPnetlib/lpi_ceria3d graph
(bipartite graph drawing)


LPnetlib/lpi_ceria3d

  • 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: 32 KB. Use UFget(708) or UFget('LPnetlib/lpi_ceria3d') in MATLAB.
  • download in Matrix Market format, file size: 66 KB.
  • download in Rutherford/Boeing format, file size: 44 KB.

    Matrix properties
    number of rows3,576
    number of columns4,400
    nonzeros21,178
    structural full rank?yes
    structural rank3,576
    # of blocks from dmperm1
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    typeinteger
    structurerectangular
    Cholesky candidate?no
    positive definite?no

    authorE. Klotz
    editorJ. Chinneck
    date
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 3576-by-1
    cfull 4400-by-1
    lofull 4400-by-1
    hifull 4400-by-1
    z0full 1-by-1

    Notes:

    An infeasible Netlib LP problem, in lp/infeas.  For more information        
    send email to netlib@ornl.gov with the message:                             
                                                                                
    	send index from lp                                                         
    	send readme from lp/infeas                                                 
                                                                                
    The lp/infeas directory contains infeasible linear programming test problems
    collected by John W. Chinneck, Carleton Univ, Ontario Canada.  The following
    are relevant excerpts from lp/infeas/readme (by John W. Chinneck):          
                                                                                
    PROBLEM DESCRIPTION                                                         
    -------------------                                                         
                                                                                
    CERIA3D:  large problem which has some peculiarities.  There are no         
    column bounds, and it is highly degenerate.  Contributor:  Ed Klotz,        
    CPLEX Optimization Inc.                                                     
                                                                                
    Name       Rows   Cols   Nonzeros Bounds      Notes                         
    ceria3d    3577    824    17604   B FR         dense col (> 967)            
                                                                                
    

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD1,596,060
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD3,680,015

    SVD-based statistics:
    norm(A)47.7319
    min(svd(A))1
    cond(A)47.7319
    rank(A)3,576
    sprank(A)-rank(A)0
    null space dimension0
    full numerical rank?yes

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

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