• 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

  • Matrix: LPnetlib/lp_agg3
  • Description: Netlib LP problem agg3: minimize c'*x, where Ax=b, lo<=x<=hi
  • download as a MATLAB mat-file, file size: 18 KB. Use UFget(600) or UFget('LPnetlib/lp_agg3') in MATLAB.
  • download in Matrix Market format
  • download in Rutherford/Boeing format

    LPnetlib/lp_agg3

    Matrix properties
    number of rows516
    number of columns758
    nonzeros4,756
    structural full rank?yes
    structural rank516
    # of blocks from dmperm1
    # strongly connected comp.1
    entries not in dmperm blocks0
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    typereal
    structurerectangular
    Cholesky candidate?no
    positive definite?no

    authorR. Leachman
    editorM. Resende
    date1988
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 516-by-1
    cfull 758-by-1
    lofull 758-by-1
    hifull 758-by-1
    z0full 1-by-1

    Notes:

    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         
AGG3        517    302     4531      32570        1.0312115935E+07        
                                                                          
Provided by Mauricio Resende.  Formulated by R. C. Leachman.              
Added to Netlib on 6 May 1988

    Ordering statistics:AMD METIS
    nnz(V) for QR, upper bound nnz(L) for LU39,655 28,045
    nnz(R) for QR, upper bound nnz(U) for LU24,033 22,623

    Maintained by Tim Davis, last updated 05-Mar-2008.
    Matrix pictures by cspy, a MATLAB function in the CSparse package.