Matrix: LPnetlib/lp_gfrd_pnc

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

LPnetlib/lp_gfrd_pnc graph
(bipartite graph drawing)

LPnetlib/lp_gfrd_pnc dmperm of LPnetlib/lp_gfrd_pnc

  • 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: 8 KB. Use UFget(629) or UFget('LPnetlib/lp_gfrd_pnc') in MATLAB.
  • download in Matrix Market format, file size: 12 KB.
  • download in Rutherford/Boeing format, file size: 9 KB.

    Matrix properties
    number of rows616
    number of columns1,160
    structural full rank?yes
    structural rank616
    # of blocks from dmperm27
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

    authorR. Helgason, J. Kennington, P. Wong
    editorR. Fourer
    kindlinear programming problem
    2D/3D problem?no

    Additional fieldssize and type
    bfull 616-by-1
    cfull 1160-by-1
    lofull 1160-by-1
    hifull 1160-by-1
    z0full 1-by-1


    A Netlib LP problem, in lp/data.  For more information                    
    send email to 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         
    GFRD-PNC    617   1092     3467      24476  B     6.9022359995E+06        
            BOUND-TYPE TABLE                                                  
    GFRD-PNC   UP LO                                                          
    Supplied by Bob Fourer.                                                   
    Source: GFRD-PNC, SIERRA: R. Helgason, J. Kennington, and P. Wong,        
    "An Application of Network Programming for National Forest Planning",     
    Technical Report OR 81006, Dept. of Operations Research, Southern         
    Methodist University.                                                     

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD18,975
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD2,525

    SVD-based statistics:
    null space dimension0
    full numerical rank?yes

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

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