Matrix: LPnetlib/lpi_galenet

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

LPnetlib/lpi_galenet graph
(bipartite graph drawing)


LPnetlib/lpi_galenet

  • 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: 1 KB. Use UFget(715) or UFget('LPnetlib/lpi_galenet') in MATLAB.
  • download in Matrix Market format, file size: 1 KB.
  • download in Rutherford/Boeing format, file size: 1 KB.

    Matrix properties
    number of rows8
    number of columns14
    nonzeros22
    structural full rank?yes
    structural rank8
    # 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

    authorH. Greenberg
    editorJ. Chinneck
    date
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 8-by-1
    cfull 14-by-1
    lofull 14-by-1
    hifull 14-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                                                         
    -------------------                                                         
                                                                                
    GALENET:  a very small network problem.  Contributor:  H.J.  Greenberg,     
    University of Colorado at Denver.                                           
                                                                                
    Name       Rows   Cols   Nonzeros Bounds      Notes                         
    galenet       9      8       16   B                                         
                                                                                
    

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD31
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD17

    SVD-based statistics:
    norm(A)2.42798
    min(svd(A))0.841189
    cond(A)2.88637
    rank(A)8
    sprank(A)-rank(A)0
    null space dimension0
    full numerical rank?yes

    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/lpi_galenet 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.