Description: Netlib LP problem d6cube: minimize c'*x, where Ax=b, lo<=x<=hi
|(bipartite graph drawing)|
|number of rows||415|
|number of columns||6,184|
|structural full rank?||no|
|# of blocks from dmperm||3|
|# strongly connected comp.||12|
|explicit zero entries||0|
|nonzero pattern symmetry||0%|
|numeric value symmetry||0%|
|kind||linear programming problem|
|Additional fields||size and type|
A Netlib LP problem, in lp/data. For more information send email to email@example.com with the message: send index from lp send readme from lp/data The following are relevant excerpts from lp/data/readme (by David M. Gay): The column and nonzero counts in the PROBLEM SUMMARY TABLE below exclude slack and surplus columns and the right-hand side vector, but include the cost row. We have omitted other free rows and all but the first right-hand side vector, as noted below. The byte count is for the MPS compressed file; it includes a newline character at the end of each line. These files start with a blank initial line intended to prevent mail programs from discarding any of the data. The BR column indicates whether a problem has bounds or ranges: B stands for "has bounds", R for "has ranges". The BOUND-TYPE TABLE below shows the bound types present in those problems that have bounds. The optimal value is from MINOS version 5.3 (of Sept. 1988) running on a VAX with default options. PROBLEM SUMMARY TABLE Name Rows Cols Nonzeros Bytes BR Optimal Value D6CUBE 416 6184 43888 167633 B 3.1549166667E+02 BOUND-TYPE TABLE D6CUBE LO Supplied by Robert Hughes. Of D6CUBE, Robert Hughes says, "Mike Anderson and I are working on the problem of finding the minimum cardinality of triangulations of the 6-dimensional cube. The optimal objective value of the problem I sent you provides a lower bound for the cardinalities of all triangulations which contain a certain simplex of volume 8/6! and which contains the centroid of the 6-cube in its interior. The linear programming problem is not easily described." Added to Netlib on 26 March 1993
|nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD||1,123,643|
|nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD||55,246|
|null space dimension||11|
|full numerical rank?||no|
|singular value gap||1.71302e+14|
|singular values (MAT file):||click here|
|SVD method used:||s = svd (full (A)) ;|
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.