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

35 
Num Cols

89 
Nonzeros

140 
Pattern Entries

140 
Kind

Linear Programming Problem 
Symmetric

No 
Date

1989 
Author

H. Greenberg 
Editor

J. Chinneck 
Structural Rank 
35 
Structural Rank Full 
true 
Num Dmperm Blocks

3 
Strongly Connect Components

6 
Num Explicit Zeros

0 
Pattern Symmetry

0% 
Numeric Symmetry

0% 
Cholesky Candidate

no 
Positive Definite

no 
Type

integer 
SVD Statistics 
Matrix Norm 
2.947116e+00 
Minimum Singular Value 
1.000000e+00 
Condition Number 
2.947116e+00

Rank 
35 
sprank(A)rank(A) 
0 
Null Space Dimension 
0 
Full Numerical Rank? 
yes 
Download Singular Values 
MATLAB

Download 
MATLAB
Rutherford Boeing
Matrix Market

Notes 
An infeasible Netlib LP problem, in lp/infeas. For more information
send email to netlib@ornl.gov with the message:
send index from lp
send readme from lp/infeas
The lp/infeas directory contains infeasible linear programming test problems
collected by John W. Chinneck, Carleton Univ, Ontario Canada. The following
are relevant excerpts from lp/infeas/readme (by John W. Chinneck):
In the following, IIS stands for Irreducible Infeasible Subsystem, a set
of constraints which is itself infeasible, but becomes feasible when any
one member is removed. Isolating an IIS from within the larger set of
constraints defining the model is one analysis approach.
PROBLEM DESCRIPTION

FOREST6, WOODINFE: very small problems derived from networkbased
forestry models. The IIS in FOREST6 includes most of the rows.
WOODINFE is the example problem discussed in detail in Greenberg [1993],
and has a very small IIS. Contributor: H.J. Greenberg, University of
Colorado at Denver.
Name Rows Cols Nonzeros Bounds Notes
woodinfe 36 89 209 B
REFERENCES

H.J. Greenberg (1993). "A ComputerAssisted Analysis System for
Mathematical Programming Models and Solutions: A User's Guide for
ANALYZE", Kluwer Academic Publishers, Boston.
