Netlib LP problem klein1: minimize c'*x, where Ax=b, lo<=x<=hi
Name lpi_klein1
Group LPnetlib
Matrix ID 721
Num Rows 54
Num Cols 108
Nonzeros 750
Pattern Entries 750
Kind Linear Programming Problem
Symmetric No
Author E. Klotz
Editor J. Chinneck
Structural Rank 54
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 integer
SVD Statistics
Matrix Norm 5.478892e+03
Minimum Singular Value 1.000000e+00
Condition Number 5.478892e+03
Rank 54
sprank(A)-rank(A) 0
Null Space Dimension 0
Full Numerical Rank? yes
Download Singular Values MATLAB
Download MATLAB Rutherford Boeing Matrix Market
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):          
PROBLEM DESCRIPTION                                                         
KLEIN1, KLEIN2, KLEIN3:  related small and medium size problems.            
Contributor:  Ed Klotz, CPLEX Optimization Inc.                             
Name       Rows   Cols   Nonzeros Bounds      Notes                         
klein1       55     54      696