LPnetlib/lpi_gran
Netlib LP problem gran: minimize c'*x, where Ax=b, lo<=x<=hi
| Name |
lpi_gran |
| Group |
LPnetlib |
| Matrix ID |
717 |
|
Num Rows
|
2,658 |
|
Num Cols
|
2,525 |
|
Nonzeros
|
20,111 |
|
Pattern Entries
|
20,111 |
|
Kind
|
Linear Programming Problem |
|
Symmetric
|
No |
|
Date
|
1993 |
|
Author
|
R. Main |
|
Editor
|
J. Chinneck |
| Structural Rank |
2,311 |
| Structural Rank Full |
false |
|
Num Dmperm Blocks
|
1,267 |
|
Strongly Connect Components
|
1,243 |
|
Num Explicit Zeros
|
0 |
|
Pattern Symmetry
|
0% |
|
Numeric Symmetry
|
0% |
|
Cholesky Candidate
|
no |
|
Positive Definite
|
no |
|
Type
|
real |
| SVD Statistics |
| Matrix Norm |
2.079021e+03 |
| Minimum Singular Value |
1.791193e-17 |
| Condition Number |
1.160690e+20
|
| Rank |
1,938 |
| sprank(A)-rank(A) |
373 |
| Null Space Dimension |
587 |
| Full Numerical Rank? |
no |
| 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
-------------------
GOSH, GRAN, PANG: these very large, large, and medium size models,
respectively, problems arose from British Petroleum operations models.
Contributor: Roger Main, BP Oil.
Name Rows Cols Nonzeros Bounds Notes
gran 2569 2520 20151 B FX
Added to Netlib on Sept. 19, 1993
|
