Matrix: LPnetlib/lpi_qual
Description: Netlib LP problem qual: minimize c'*x, where Ax=b, lo<=x<=hi
|
| (bipartite graph drawing) |
 |
 |
| Matrix properties | |
| number of rows | 323 |
| number of columns | 464 |
| nonzeros | 1,646 |
| structural full rank? | yes |
| structural rank | 323 |
| # of blocks from dmperm | 13 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 0% |
| numeric value symmetry | 0% |
| type | real |
| structure | rectangular |
| Cholesky candidate? | no |
| positive definite? | no |
| author | T. Baker |
| editor | J. Chinneck |
| date | 1993 |
| kind | linear programming problem |
| 2D/3D problem? | no |
| Additional fields | size and type |
| b | full 323-by-1 |
| c | full 464-by-1 |
| lo | full 464-by-1 |
| hi | full 464-by-1 |
| z0 | full 1-by-1 |
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
-------------------
CHEMCOM, QUAL, REFINERY, REACTOR, VOL1: medium size problems derived
from a petrochemical plant model. Doctored to generate infeasibility
due to inability to meet volume or quality restrictions. With the
exception of REACTOR, these are highly volatile problems, yielding IISs
of varying sizes when different IIS isolation algorithms are applied.
See Chinneck [1993] for further discussion. Contributor: Tom Baker,
Chesapeake Decision Sciences.
Name Rows Cols Nonzeros Bounds Notes
qual 324 464 1714 B FX
REFERENCES
----------
J.W. Chinneck (1993). "Finding the Most Useful Subset of Constraints
for Analysis in an Infeasible Linear Program", technical report
SCE-93-07, Systems and Computer Engineering, Carleton University,
Ottawa, Canada.
| Ordering statistics: | result |
| nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 14,310 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 5,067 |
| SVD-based statistics: | |
| norm(A) | 10117.3 |
| min(svd(A)) | 0.209625 |
| cond(A) | 48263.7 |
| rank(A) | 323 |
| sprank(A)-rank(A) | 0 |
| null space dimension | 0 |
| full numerical rank? | yes |
| singular values (MAT file): | click here |
| SVD method used: | s = svd (full (A)) ; |
| status: | ok |
For a description of the statistics displayed above, click here.
Maintained by Tim Davis, last updated 12-Mar-2014.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.