![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
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