Matrix: LPnetlib/lp_gfrd_pnc
Description: Netlib LP problem gfrd_pnc: minimize c'*x, where Ax=b, lo<=x<=hi
|
| (bipartite graph drawing) |
 |
 |
| Matrix properties | |
| number of rows | 616 |
| number of columns | 1,160 |
| nonzeros | 2,445 |
| structural full rank? | yes |
| structural rank | 616 |
| # of blocks from dmperm | 27 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 0% |
| numeric value symmetry | 0% |
| type | real |
| structure | rectangular |
| Cholesky candidate? | no |
| positive definite? | no |
| author | R. Helgason, J. Kennington, P. Wong |
| editor | R. Fourer |
| date | |
| kind | linear programming problem |
| 2D/3D problem? | no |
| Additional fields | size and type |
| b | full 616-by-1 |
| c | full 1160-by-1 |
| lo | full 1160-by-1 |
| hi | full 1160-by-1 |
| z0 | full 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 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 COLAMD | 18,975 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 2,525 |
| SVD-based statistics: | |
| norm(A) | 3555.19 |
| min(svd(A)) | 0.0381229 |
| cond(A) | 93256.2 |
| rank(A) | 616 |
| sprank(A)-rank(A) | 0 |
| null space dimension | 0 |
| full numerical rank? | yes |
| singular values (MAT file): | click here |
| SVD method used: | s = svd (full (A)) ; |
| status: | ok |
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.