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


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


    dmperm of LPnetlib/lp_greenbeb

    scc of LPnetlib/lp_greenbeb

    Matrix properties (click for a legend)  
    number of rows2,392
    number of columns5,598
    structural full rank?no
    structural rank2,389
    numerical rank 2,389
    dimension of the numerical null space3,209
    numerical rank / min(size(A))0.99875
    Euclidean norm of A 106.23
    calculated singular value # 23890.024208
    numerical rank defined using a tolerance
    max(size(A))*eps(norm(A)) =
    calculated singular value # 23902.0565e-016
    gap in the singular values at the numerical rank:
    singular value # 2389 / singular value # 2390
    calculated condition number4.1701e+065
    # of blocks from dmperm75
    # strongly connected comp.9
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

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

    Additional fieldssize and type
    bfull 2392-by-1
    cfull 5598-by-1
    lofull 5598-by-1
    hifull 5598-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 BOUND-TYPE TABLE below shows the bound types       
    present in those problems that have bounds.                               
    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         
    GREENBEB   2393   5405    31499     235739  B    -4.3021476065E+06        
            BOUND-TYPE TABLE                                                  
    GREENBEB   UP LO FX FR                                                    
    Supplied by Bob Fourer.                                                   
    Empty RHS section.                                                        
    When included in Netlib: Extra bound sets omitted,  extra free            
    rows omitted.                                                             
    Problems GREENBEA and GREENBEB differ only in their BOUNDS sections.      
    Bob Bixby reports that the CPLEX solver (running on a Sparc station)      
    finds slightly different optimal values for some of the problems.         
    On a MIPS processor, MINOS version 5.3 (with crash and scaling of         
    December 1989) also finds different optimal values for some of the        
    problems.  The following table shows the values that differ from those    
    shown above.  (Whether CPLEX finds different values on the recently       
    added problems remains to be seen.)                                       
    Problem        CPLEX(Sparc)          MINOS(MIPS)                          
    GREENBEB    -4.3022602612E+06    -4.3021537702E+06                        
    Source:   GREENBEA, GREENBEB: a large refinery model; see the book        
    "A Model-Management Framework for Mathematical Programming" by Kenneth    
    H. Palmer et al. (John Wiley & Sons, New York, 1984).                     
    Added to Netlib on  6 May 1988                                            

    Ordering statistics:AMD METIS
    nnz(V) for QR, upper bound nnz(L) for LU700,189 514,181
    nnz(R) for QR, upper bound nnz(U) for LU79,425 84,777

    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.