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

24 
Num Cols

1,049 
Nonzeros

13,427 
Pattern Entries

13,427 
Kind

Linear Programming Problem 
Symmetric

No 
Date

1990 
Author

R. Fourer 
Editor

R. Fourer 
Structural Rank 
24 
Structural Rank Full 
true 
Num Dmperm Blocks

1 
Strongly Connect Components

1 
Num Explicit Zeros

0 
Pattern Symmetry

0% 
Numeric Symmetry

0% 
Cholesky Candidate

no 
Positive Definite

no 
Type

real 
SVD Statistics 
Matrix Norm 
1.216092e+04 
Minimum Singular Value 
2.578397e+00 
Condition Number 
4.716466e+03

Rank 
24 
sprank(A)rank(A) 
0 
Null Space Dimension 
0 
Full Numerical Rank? 
yes 
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 BOUNDTYPE 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
FIT1D 25 1026 14430 51734 B 9.1463780924E+03
BOUNDTYPE TABLE
FIT1D UP
Supplied by Bob Fourer.
When included in Netlib: Cost coefficients negated.
Concerning FIT1D, FIT1P, FIT2D, FIT2P, Bob Fourer says
The pairs FIT1P/FIT1D and FIT2P/FIT2D are primal and
dual versions of the same two problems [except that we
have negated the cost coefficients of the dual problems
so all are minimization problems]. They originate from
a model for fitting linear inequalities to data, by
minimization of a sum of piecewiselinear penalties.
The FIT1 problems are based on 627 data points and 23
pieces per primal pl penalty term. The FIT2 problems
are based on 3000 data points (from a different sample
altogether) and 45 pieces per pl term.
Added to Netlib on 31 Jan. 1990
