Netlib LP problem ceria3d: minimize c'*x, where Ax=b, lo<=x<=hi
Name lpi_ceria3d
Group LPnetlib
Matrix ID 708
Num Rows 3,576
Num Cols 4,400
Nonzeros 21,178
Pattern Entries 21,178
Kind Linear Programming Problem
Symmetric No
Author E. Klotz
Editor J. Chinneck
Structural Rank 3,576
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 4.773186e+01
Minimum Singular Value 1.000000e+00
Condition Number 4.773186e+01
Rank 3,576
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                                                         
CERIA3D:  large problem which has some peculiarities.  There are no         
column bounds, and it is highly degenerate.  Contributor:  Ed Klotz,        
CPLEX Optimization Inc.                                                     
Name       Rows   Cols   Nonzeros Bounds      Notes                         
ceria3d    3577    824    17604   B FR         dense col (> 967)