Netlib LP problem mondou2: minimize c'*x, where Ax=b, lo<=x<=hi
Name lpi_mondou2
Group LPnetlib
Matrix ID 724
Num Rows 312
Num Cols 604
Nonzeros 1,208
Pattern Entries 1,208
Kind Linear Programming Problem
Symmetric No
Author J. Mondou
Editor J. Chinneck
Structural Rank 312
Structural Rank Full true
Num Dmperm Blocks 10
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.488187e+00
Minimum Singular Value 9.571048e-16
Condition Number 4.689337e+15
Rank 311
sprank(A)-rank(A) 1
Null Space Dimension 1
Full Numerical Rank? no
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                                                         
MONDOU2:  medium size problem generated as a subproblem to a larger         
facility sizing algorithm used by Hydro-Quebec.  The diagnosis of the       
infeasibility in the subproblem is useful to the larger algorithm.          
Contributor:  J.-F.  Mondou, Hydro-Quebec.                                  
Name       Rows   Cols   Nonzeros Bounds      Notes                         
mondou2     313    604     1623   B