LPnetlib/lpi_bgprtr
Netlib LP problem bgprtr: minimize c'*x, where Ax=b, lo<=x<=hi
| Name |
lpi_bgprtr |
| Group |
LPnetlib |
| Matrix ID |
706 |
|
Num Rows
|
20 |
|
Num Cols
|
40 |
|
Nonzeros
|
70 |
|
Pattern Entries
|
70 |
|
Kind
|
Linear Programming Problem |
|
Symmetric
|
No |
|
Date
|
1993 |
|
Author
|
L. Schrage |
|
Editor
|
J. Chinneck |
| Structural Rank |
20 |
| Structural Rank Full |
true |
|
Num Dmperm Blocks
|
1 |
|
Strongly Connect Components
|
1 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
0% |
|
Numeric Symmetry
|
0% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
integer |
| SVD Statistics |
| Matrix Norm |
9.045101e+02 |
| Minimum Singular Value |
7.501339e-01 |
| Condition Number |
1.205798e+03
|
| Rank |
20 |
| sprank(A)-rank(A) |
0 |
| Null Space Dimension |
0 |
| Full Numerical Rank? |
yes |
| Download Singular Values |
MATLAB
|
| Download |
MATLAB
Rutherford Boeing
Matrix Market
|
| 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
|
