A necessary and sufficient criterion to guarantee feasibility of the interval Gaussian algorithm for a class of matrices
A necessary and sufficient to guarantee feasibility of the interval Gaussian algorithms for a class of matrices. We apply the interval Gaussian algorithm to an interval matrix the comparison matrix of which is irreducible and diagonally dominant. We derive a new necessary and sufficient criterion for the feasibility of this method extending a recently given sufficient criterion.