• 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/lpi_mondou2
  • Description: Netlib LP problem mondou2: minimize c'*x, where Ax=b, lo<=x<=hi
  • download as a MATLAB mat-file, file size: 8 KB. Use SJget(273) or SJget('LPnetlib/lpi_mondou2') in MATLAB.
  • download in Matrix Market format, file size: 7 KB.
  • download in Rutherford/Boeing format, file size: 6 KB.


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


    dmperm of LPnetlib/lpi_mondou2

    Matrix properties (click for a legend)  
    number of rows312
    number of columns604
    structural full rank?yes
    structural rank312
    numerical rank 311
    dimension of the numerical null space293
    numerical rank / min(size(A))0.99679
    Euclidean norm of A 4.4882
    calculated singular value # 3110.10794
    numerical rank defined using a tolerance
    max(size(A))*eps(norm(A)) =
    calculated singular value # 3128.595e-016
    gap in the singular values at the numerical rank:
    singular value # 311 / singular value # 312
    calculated condition number5.2219e+015
    # of blocks from dmperm10
    # strongly connected comp.1
    entries not in dmperm blocks9
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

    authorJ. Mondou
    editorJ. Chinneck
    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


    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:AMD METIS DMPERM+
    nnz(V) for QR, upper bound nnz(L) for LU4,810 3,999 4,682
    nnz(R) for QR, upper bound nnz(U) for LU923 990 902

    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.