Matrix: LPnetlib/lpi_galenet
Description: Netlib LP problem galenet: minimize c'*x, where Ax=b, lo<=x<=hi
| Matrix properties | |
| number of rows | 8 |
| number of columns | 14 |
| nonzeros | 22 |
| structural full rank? | yes |
| structural rank | 8 |
| # of blocks from dmperm | 1 |
| # strongly connected comp. | 1 |
| entries not in dmperm blocks | 0 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 0% |
| numeric value symmetry | 0% |
| type | integer |
| structure | rectangular |
| Cholesky candidate? | no |
| positive definite? | no |
| author | H. Greenberg |
| editor | J. Chinneck |
| date | |
| kind | linear programming problem |
| 2D/3D problem? | no |
| Additional fields | size and type |
| b | full 8-by-1 |
| c | full 14-by-1 |
| lo | full 14-by-1 |
| hi | full 14-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):
PROBLEM DESCRIPTION
-------------------
GALENET: a very small network problem. Contributor: H.J. Greenberg,
University of Colorado at Denver.
Name Rows Cols Nonzeros Bounds Notes
galenet 9 8 16 B
| Ordering statistics: | AMD | METIS |
| nnz(V) for QR, upper bound nnz(L) for LU | 31 | 30 |
| nnz(R) for QR, upper bound nnz(U) for LU | 17 | 17 |
Maintained by Tim Davis, last updated 05-Nov-2008.
Matrix pictures by cspy, a MATLAB function in the CSparse package.
Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.