Matrix: LPnetlib/lpi_bgprtr
Description: Netlib LP problem bgprtr: minimize c'*x, where Ax=b, lo<=x<=hi
| Matrix properties | |
| number of rows | 20 |
| number of columns | 40 |
| nonzeros | 70 |
| structural full rank? | yes |
| structural rank | 20 |
| # 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 | L. Schrage |
| editor | J. Chinneck |
| date | 1993 |
| kind | linear programming problem |
| 2D/3D problem? | no |
| Additional fields | size and type |
| b | full 20-by-1 |
| c | full 40-by-1 |
| lo | full 40-by-1 |
| hi | full 40-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
-------------------
BGPRTR is a small model for a multiproduct, multiperiod production
scheduling model. One right hand side has been altered to make it
infeasible.
Contributor: Linus Schrage, University of Chicago and LINDO Systems Inc.
Name Rows Cols Nonzeros Bounds Notes
bgprtr 21 34 90
Added to Netlib on Sept. 19, 1993
| Ordering statistics: | AMD | METIS |
| nnz(V) for QR, upper bound nnz(L) for LU | 208 | 163 |
| nnz(R) for QR, upper bound nnz(U) for LU | 80 | 81 |
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.