Finding all linearly dependent rows in large-scale linear programming

All the new interior-point algorithms for linear programming (LP) assume that the rows of the constraint matrix are linearly independent. The assumption is necessary, because the algorithms solve a certain linear system which does not have a unique solution in the case of dependent rows. In this paper we study a pivoting based approach for finding all the linearly dependent rows. Moreover encouraging computational results are reported