ngraph.sparse-collection/LPnetlib/lpi_itest2/index.js

Subset of the University of Florida sparse matrix collection

module.exports = {"recordsPerEdge":3,"links":[1,10,-0.5,2,10,2,3,10,3,7,10,1,8,10,1,1,11,1,2,11,-1,3,11,1,8,11,2,9,11,1,5,12,3,6,12,1,8,12,1,9,12,1,4,13,1,5,13,-1,7,13,1],"description":"%MatrixMarket matrix coordinate real general\n-------------------------------------------------------------------------------\n UF Sparse Matrix Collection, Tim Davis\n http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lpi_itest2\n name: LPnetlib/lpi_itest2\n [Netlib LP problem itest2: minimize c'*x, where Ax=b, lo<=x<=hi]\n id: 719\n date: 1991\n author: J. Chinneck, E. Dravnieks\n ed: J. Chinneck\n fields: title name A b id aux kind date author ed notes\n aux: c lo hi z0\n kind: linear programming problem\n-------------------------------------------------------------------------------\n notes:\n An infeasible Netlib LP problem, in lp/infeas.  For more information        \n send email to netlib@ornl.gov with the message:                             \n                                                                             \n \tsend index from lp                                                         \n \tsend readme from lp/infeas                                                 \n                                                                             \n The lp/infeas directory contains infeasible linear programming test problems\n collected by John W. Chinneck, Carleton Univ, Ontario Canada.  The following\n are relevant excerpts from lp/infeas/readme (by John W. Chinneck):          \n                                                                             \n In the following, IIS stands for Irreducible Infeasible Subsystem, a set    \n of constraints which is itself infeasible, but becomes feasible when any    \n one member is removed.  Isolating an IIS from within the larger set of      \n constraints defining the model is one analysis approach.                    \n                                                                             \n PROBLEM DESCRIPTION                                                         \n -------------------                                                         \n                                                                             \n ITEST6, ITEST2:  very small problems having numerous clustered IISs.        \n These match problems 1 and 2, respectively, in Chinneck and Dravnieks       \n [1991].  Contributors:  J.W.  Chinneck and E.W.  Dravnieks, Carleton        \n University.                                                                 \n                                                                             \n Name       Rows   Cols   Nonzeros Bounds      Notes                         \n itest2       10      4       17                                             \n                                                                             \n REFERENCES                                                                  \n ----------                                                                  \n                                                                             \n J.W.  Chinneck and E.W.  Dravnieks (1991).  \"Locating Minimal Infeasible    \n Constraint Sets in Linear Programs\", ORSA Journal on Computing, Volume      \n 3, No. 2.                                                                   \n                                                                             \n-------------------------------------------------------------------------------"};