Netlib LP problem galenet: minimize c'*x, where Ax=b, lo<=x<=hi
Name lpi_galenet
Group LPnetlib
Matrix ID 715
Num Rows 8
Num Cols 14
Nonzeros 22
Pattern Entries 22
Kind Linear Programming Problem
Symmetric No
Author H. Greenberg
Editor J. Chinneck
Structural Rank 8
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 2.427984e+00
Minimum Singular Value 8.411887e-01
Condition Number 2.886373e+00
Rank 8
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                                                         
GALENET:  a very small network problem.  Contributor:  H.J.  Greenberg,     
University of Colorado at Denver.                                           
Name       Rows   Cols   Nonzeros Bounds      Notes                         
galenet       9      8       16   B