ngraph.sparse-collection
Version:
Subset of the University of Florida sparse matrix collection
100 lines (40 loc) • 3.35 kB
Markdown
UF Sparse Matrix Collection, Tim Davis
http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lp_gfrd_pnc
[]
id: 629
date:
author: R. Helgason, J. Kennington, P. Wong
ed: R. Fourer
fields: title name A b id aux kind date author ed notes
aux: c lo hi z0
kind: linear programming problem
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.
