ngraph.sparse-collection
Version:
Subset of the University of Florida sparse matrix collection
66 lines (27 loc) • 2.06 kB
Markdown
# LPnetlib/lpi_ceria3d
UF Sparse Matrix Collection, Tim Davis
http://www.cise.ufl.edu/research/sparse/matrices/LPnetlib/lpi_ceria3d
[Netlib LP problem ceria3d: minimize c'*x, where Ax=b, lo<=x<=hi]
id: 708
date:
author: E. Klotz
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
-------------------
CERIA3D: large problem which has some peculiarities. There are no
column bounds, and it is highly degenerate. Contributor: Ed Klotz,
CPLEX Optimization Inc.
Name Rows Cols Nonzeros Bounds Notes
ceria3d 3577 824 17604 B FR dense col (> 967)
