Matrix: LPnetlib/lpi_mondou2

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

LPnetlib/lpi_mondou2 graph
(bipartite graph drawing)


LPnetlib/lpi_mondou2 dmperm of LPnetlib/lpi_mondou2

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

    Matrix properties
    number of rows312
    number of columns604
    nonzeros1,208
    structural full rank?yes
    structural rank312
    # of blocks from dmperm10
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    typeinteger
    structurerectangular
    Cholesky candidate?no
    positive definite?no

    authorJ. Mondou
    editorJ. Chinneck
    date
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 312-by-1
    cfull 604-by-1
    lofull 604-by-1
    hifull 604-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                                                         
    -------------------                                                         
                                                                                
    MONDOU2:  medium size problem generated as a subproblem to a larger         
    facility sizing algorithm used by Hydro-Quebec.  The diagnosis of the       
    infeasibility in the subproblem is useful to the larger algorithm.          
    Contributor:  J.-F.  Mondou, Hydro-Quebec.                                  
                                                                                
    Name       Rows   Cols   Nonzeros Bounds      Notes                         
    mondou2     313    604     1623   B                                         
                                                                                
    

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD4,810
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD923

    SVD-based statistics:
    norm(A)4.48819
    min(svd(A))9.57105e-16
    cond(A)4.68934e+15
    rank(A)311
    sprank(A)-rank(A)1
    null space dimension1
    full numerical rank?no
    singular value gap1.12774e+14

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

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