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


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


    dmperm of LPnetlib/lp_ship12l

    scc of LPnetlib/lp_ship12l

    Matrix properties (click for a legend)  
    number of rows1,151
    number of columns5,533
    structural full rank?no
    structural rank1,042
    numerical rank 1,042
    dimension of the numerical null space4,491
    numerical rank / min(size(A))0.9053
    Euclidean norm of A 11.975
    calculated singular value # 10420.11203
    numerical rank defined using a tolerance
    max(size(A))*eps(norm(A)) =
    calculated singular value # 10432.2149e-014
    gap in the singular values at the numerical rank:
    singular value # 1042 / singular value # 1043
    calculated condition numberInf
    # of blocks from dmperm206
    # strongly connected comp.110
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

    authorR. Fourer
    editorR. Fourer
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 1151-by-1
    cfull 5533-by-1
    lofull 5533-by-1
    hifull 5533-by-1
    z0full 1-by-1


    A Netlib LP problem, in lp/data.  For more information                    
    send email to netlib@ornl.gov with the message:                           
    	 send index from lp                                                      
    	 send readme from lp/data                                                
    The following are relevant excerpts from lp/data/readme (by David M. Gay):
    The column and nonzero counts in the PROBLEM SUMMARY TABLE below exclude  
    slack and surplus columns and the right-hand side vector, but include     
    the cost row.  We have omitted other free rows and all but the first      
    right-hand side vector, as noted below.  The byte count is for the        
    MPS compressed file; it includes a newline character at the end of each   
    line.  These files start with a blank initial line intended to prevent    
    mail programs from discarding any of the data.  The BR column indicates   
    whether a problem has bounds or ranges:  B stands for "has bounds", R     
    for "has ranges".                                                         
    The optimal value is from MINOS version 5.3 (of Sept. 1988)               
    running on a VAX with default options.                                    
                           PROBLEM SUMMARY TABLE                              
    Name       Rows   Cols   Nonzeros    Bytes  BR      Optimal Value         
    SHIP12L    1152   5427    21597     146753        1.4701879193E+06        
    Supplied by Bob Fourer.                                                   
    When included in Netlib: Extra free rows omitted.                         
    Source: consulting.                                                       

    Ordering statistics:AMD METIS
    nnz(V) for QR, upper bound nnz(L) for LU173,543 114,843
    nnz(R) for QR, upper bound nnz(U) for LU12,420 12,838

    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.