Netlib LP problem ex73a: minimize c'*x, where Ax=b, lo<=x<=hi
Name lpi_ex73a
Group LPnetlib
Matrix ID 713
Num Rows 193
Num Cols 211
Nonzeros 457
Pattern Entries 457
Kind Linear Programming Problem
Symmetric No
Date 1992
Author Z. You
Editor J. Chinneck
Structural Rank 193
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.928749e+00
Minimum Singular Value 6.144511e-17
Condition Number 4.766448e+16
Rank 188
sprank(A)-rank(A) 5
Null Space Dimension 5
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):          
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                                                         
BOX1, EX72A, EX73A:  medium problems derived from research on using the     
infeasibility version of viability analysis [Chinneck 1992] to analyze      
petri net models.  All three problems are volatile, showing IISs of         
widely differing size depending on the algorithm applied.  Contributor:     
Zhengping You, Carleton University.                                         
Name       Rows   Cols   Nonzeros Bounds      Notes                         
ex73a       194    211      668   B            all cols are LO bounded      
J.W.  Chinneck (1992).  "Viability Analysis:  A Formulation Aid for All     
Classes of Network Models", Naval Research Logistics, Vol.  39, pp.         
Added to Netlib on Sept. 19, 1993