ngraph.sparse-collection
Version:
Subset of the University of Florida sparse matrix collection
72 lines (29 loc) • 2.29 kB
Markdown
# LPnetlib/lpi_bgprtr
UF Sparse Matrix Collection, Tim Davis
http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lpi_bgprtr
[Netlib LP problem bgprtr: minimize c'*x, where Ax=b, lo<=x<=hi]
id: 706
date: 1993
author: L. Schrage
ed: J. Chinneck
fields: title name A b id aux kind date author ed notes
aux: c lo hi z0
kind: linear programming problem
notes:
An infeasible Netlib LP problem, in lp/infeas. For more information
send email to netlib@ornl.gov with the message:
send index from lp
send readme from lp/infeas
The lp/infeas directory contains infeasible linear programming test problems
collected by John W. Chinneck, Carleton Univ, Ontario Canada. The following
are relevant excerpts from lp/infeas/readme (by John W. Chinneck):
PROBLEM DESCRIPTION
-------------------
BGPRTR is a small model for a multiproduct, multiperiod production
scheduling model. One right hand side has been altered to make it
infeasible.
Contributor: Linus Schrage, University of Chicago and LINDO Systems Inc.
Name Rows Cols Nonzeros Bounds Notes
bgprtr 21 34 90
Added to Netlib on Sept. 19, 1993
