LPnetlib/lp_gfrd_pnc
Netlib LP problem gfrd_pnc: minimize c'*x, where Ax=b, lo<=x<=hi
Name |
lp_gfrd_pnc |
Group |
LPnetlib |
Matrix ID |
629 |
Num Rows
|
616 |
Num Cols
|
1,160 |
Nonzeros
|
2,445 |
Pattern Entries
|
2,445 |
Kind
|
Linear Programming Problem |
Symmetric
|
No |
Date
|
|
Author
|
R. Helgason, J. Kennington, P. Wong |
Editor
|
R. Fourer |
Structural Rank |
616 |
Structural Rank Full |
true |
Num Dmperm Blocks
|
27 |
Strongly Connect Components
|
1 |
Num Explicit Zeros
|
0 |
Pattern Symmetry
|
0% |
Numeric Symmetry
|
0% |
Cholesky Candidate
|
no |
Positive Definite
|
no |
Type
|
real |
SVD Statistics |
Matrix Norm |
3.555195e+03 |
Minimum Singular Value |
3.812288e-02 |
Condition Number |
9.325618e+04
|
Rank |
616 |
sprank(A)-rank(A) |
0 |
Null Space Dimension |
0 |
Full Numerical Rank? |
yes |
Download Singular Values |
MATLAB
|
Download |
MATLAB
Rutherford Boeing
Matrix Market
|
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.
|