LPnetlib/lp_recipe

Netlib LP problem recipe: minimize c'*x, where Ax=b, lo<=x<=hi
Name lp_recipe LPnetlib 663 91 204 687 687 Linear Programming Problem No R. Fourer R. Fourer
Structural Rank 91 true 1 12 0 0% 0% no no real
SVD Statistics
Matrix Norm 6.217478e+02
Minimum Singular Value 3.002377e-02
Condition Number 2.070852e+04
Rank 91
sprank(A)-rank(A) 0
Null Space Dimension 0
Full Numerical Rank? yes
Download ```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 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 RECIPE 92 180 752 6210 B -2.6661600000E+02 BOUND-TYPE TABLE RECIPE UP LO FX Empty RHS section. Supplied by Bob Fourer. When included in Netlib: Extra bound sets omitted; extra free rows omitted. Source: consulting.```