**Matrix: LPnetlib/lp_25fv47**

Description: Netlib LP problem 25fv47: minimize c'*x, where Ax=b, lo<=x<=hi

(bipartite graph drawing) |

Matrix properties | |

number of rows | 821 |

number of columns | 1,876 |

nonzeros | 10,705 |

structural full rank? | no |

structural rank | 820 |

# of blocks from dmperm | 29 |

# strongly connected comp. | 3 |

explicit zero entries | 0 |

nonzero pattern symmetry | 0% |

numeric value symmetry | 0% |

type | real |

structure | rectangular |

Cholesky candidate? | no |

positive definite? | no |

author | J. Reid |

editor | D. Gay |

date | 1978 |

kind | linear programming problem |

2D/3D problem? | no |

Additional fields | size and type |

b | full 821-by-1 |

c | full 1876-by-1 |

lo | full 1876-by-1 |

hi | full 1876-by-1 |

z0 | full 1-by-1 |

Notes:

A Netlib LP problem, in lp/data. For more information send email to netlib@ornl.gov with the message: send index from lp send readme from lp/data ------------------------------------------------------------------------------ This LP problem is the source of nine sparse matrices in the Harwell/Boeing sparse matrix collection: BP_0, BP_200, BP_400, BP_600, BP_800, BP_1000, BP_1200, BP_1400, and BP_1600. Those nine matrices are square, nonsingular basis matrices that occured during the solution of 25FV47 (also called BP or BP1). ------------------------------------------------------------------------------ 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 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 25FV47 822 1571 11127 70477 5.5018458883E+03 From John Reid. Problem 25FV47 is sometimes called BP or BP1. Bob Bixby reports that the CPLEX solver (running on a Sparc station) finds slightly different optimal values for some of the problems. On a MIPS processor, MINOS version 5.3 (with crash and scaling of December 1989) also finds different optimal values for some of the problems. The following table shows the values that differ from those shown above. (Whether CPLEX finds different values on the recently added problems remains to be seen.) Problem CPLEX(Sparc) MINOS(MIPS) 25FV47 5.5018467791E+03

Ordering statistics: | result |

nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD | 190,271 |

nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD | 39,534 |

SVD-based statistics: | |

norm(A) | 436.918 |

min(svd(A)) | 0 |

cond(A) | Inf |

rank(A) | 820 |

sprank(A)-rank(A) | 0 |

null space dimension | 1 |

full numerical rank? | no |

singular value gap | Inf |

singular values (MAT file): | click here |

SVD method used: | s = svd (full (A)) ; |

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.
*