LPnetlib/lp_ship04s
Netlib LP problem ship04s: minimize c'*x, where Ax=b, lo<=x<=hi
Name 
lp_ship04s 
Group 
LPnetlib 
Matrix ID 
685 
Num Rows

402 
Num Cols

1,506 
Nonzeros

4,400 
Pattern Entries

4,400 
Kind

Linear Programming Problem 
Symmetric

No 
Date


Author

R. Fourer 
Editor

R. Fourer 
Structural Rank 
360 
Structural Rank Full 
false 
Num Dmperm Blocks

94 
Strongly Connect Components

43 
Num Explicit Zeros

0 
Pattern Symmetry

0% 
Numeric Symmetry

0% 
Cholesky Candidate

no 
Positive Definite

no 
Type

real 
SVD Statistics 
Matrix Norm 
1.337074e+01 
Minimum Singular Value 
0 
Condition Number 
Inf

Rank 
360 
sprank(A)rank(A) 
0 
Null Space Dimension 
42 
Full Numerical Rank? 
no 
Download Singular Values 
MATLAB

Download 
MATLAB
Rutherford Boeing
Matrix Market

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
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 righthand side vector, but include
the cost row. We have omitted other free rows and all but the first
righthand 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
SHIP04S 403 1458 5810 41257 1.7987147004E+06
Supplied by Bob Fourer.
When included in Netlib: Extra free rows omitted.
Source: consulting.
