Matrix: LPnetlib/lp_ken_11
Description: Netlib LP problem ken_11: minimize c'*x, where Ax=b, lo<=x<=hi
|
| (bipartite graph drawing) |
 |
 |
| Matrix properties | |
| number of rows | 14,694 |
| number of columns | 21,349 |
| nonzeros | 49,058 |
| structural full rank? | yes |
| structural rank | 14,694 |
| # of blocks from dmperm | 4,610 |
| # strongly connected comp. | 1 |
| explicit zero entries | 0 |
| nonzero pattern symmetry | 0% |
| numeric value symmetry | 0% |
| type | integer |
| structure | rectangular |
| Cholesky candidate? | no |
| positive definite? | no |
| author | J. Kennington |
| editor | D. Gay |
| date | 1991 |
| kind | linear programming problem |
| 2D/3D problem? | no |
| Additional fields | size and type |
| b | full 14694-by-1 |
| c | full 21349-by-1 |
| lo | full 21349-by-1 |
| hi | full 21349-by-1 |
| z0 | full 1-by-1 |
Notes:
A Netlib LP problem, in lp/data/kennington. For more information
send email to netlib@ornl.gov with the message:
send index from lp
send readme from lp/data
send readme from lp/data/kennington
The following are relevant excerpts from lp/data/kennington/readme:
The "Kennington" problems: sixteen problems described in "An Empirical
Evaluation of the KORBX Algorithms for Military Airlift Applications"
by W. J. Carolan, J. E. Hill, J. L. Kennington, S. Niemi, S. J.
Wichmann (Operations Research vol. 38, no. 2 (1990), pp. 240-248).
The following table gives some statistics for the "Kennington"
problems. The number of columns excludes slacks and surpluses.
The bounds column tells how many entries appear in the BOUNDS
section of the MPS file. The mpc column shows the bytes in
the problem after "uncompress" and before "emps"; MPS shows
the bytes after "emps". The optimal values were computed by
Vanderbei's ALPO, running on an SGI computer (with binary IEEE
arithmetic).
Name rows columns nonzeros bounds mpc MPS optimal value
KEN-11 14695 21349 70354 42698 928171 4167698 -6.9723823e+09
Submitted to Netlib by Irv Lustig.
| Ordering statistics: | result |
| nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 618,040 |
| nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 133,221 |
| SVD-based statistics: | |
| norm(A) | 11.462 |
| min(svd(A)) | 3.1051e-15 |
| cond(A) | 3.69135e+15 |
| rank(A) | 14,573 |
| sprank(A)-rank(A) | 121 |
| null space dimension | 121 |
| full numerical rank? | no |
| singular value gap | 5.61076e+11 |
| singular values (MAT file): | click here |
| SVD method used: | s = svd (full (R)) ; where [~,R,E] = spqr (A') with droptol of zero |
| 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.