ngraph.sparse-collection
Version:
Subset of the University of Florida sparse matrix collection
92 lines (37 loc) • 3.1 kB
Markdown
# LPnetlib/lpi_itest2
UF Sparse Matrix Collection, Tim Davis
http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lpi_itest2
[Netlib LP problem itest2: minimize c'*x, where Ax=b, lo<=x<=hi]
id: 719
date: 1991
author: J. Chinneck, E. Dravnieks
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):
In the following, IIS stands for Irreducible Infeasible Subsystem, a set
of constraints which is itself infeasible, but becomes feasible when any
one member is removed. Isolating an IIS from within the larger set of
constraints defining the model is one analysis approach.
PROBLEM DESCRIPTION
-------------------
ITEST6, ITEST2: very small problems having numerous clustered IISs.
These match problems 1 and 2, respectively, in Chinneck and Dravnieks
[1991]. Contributors: J.W. Chinneck and E.W. Dravnieks, Carleton
University.
Name Rows Cols Nonzeros Bounds Notes
itest2 10 4 17
REFERENCES
----------
J.W. Chinneck and E.W. Dravnieks (1991). "Locating Minimal Infeasible
Constraint Sets in Linear Programs", ORSA Journal on Computing, Volume
3, No. 2.
