ngraph.sparse-collection
Version:
Subset of the University of Florida sparse matrix collection
68 lines (28 loc) • 2.13 kB
Markdown
# LPnetlib/lpi_mondou2
UF Sparse Matrix Collection, Tim Davis
http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lpi_mondou2
[Netlib LP problem mondou2: minimize c'*x, where Ax=b, lo<=x<=hi]
id: 724
date:
author: J. Mondou
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
-------------------
MONDOU2: medium size problem generated as a subproblem to a larger
facility sizing algorithm used by Hydro-Quebec. The diagnosis of the
infeasibility in the subproblem is useful to the larger algorithm.
Contributor: J.-F. Mondou, Hydro-Quebec.
Name Rows Cols Nonzeros Bounds Notes
mondou2 313 604 1623 B
