On the Haar Condition in Algorithms for the Optimal Solution of Linear Inequalities

From among the algorithms for the optimal solution of consistent or inconsistent inequalities where the optimality criterion function is the number of satisfied constraints, three methods, namely the Warmack-Gonzalez method, Miyake-Shinmura method and Clark-Gonzalez method are considered and compared. These methods require that the analysed data satisfies the Haar condition. This, paper shows that a modified W.G. method allows a relaxation of this condition.