خوارزميات مقترحة من نوع تحليل LU لحل مسائل البرمجة الخطية كثيرة الأصفار

The solution of linear programming problems by sparse LU decomposition is an open problem providing room for further research. This paper tries to develop sparse LU decomposition – based algorithms when implementing Simplex algorithm. In this paper, we describe efficient algorithms which are based on LU decomposition for solving sparse linear programming problems. Many numerical simulations are carried out to illustrate the efficiency of the proposed algorithms. We compare the obtained results with Golub – Bartels method, Sparse Golub – Bartels method, Forrest – Tomlin method and Reid method to show the efficiency of the proposed algorithms. From the numerical experiments carried out, it is shown that the proposed algorithms are much better than that of available methods. So we recommend using this method in software packages as new alternative for solving the sparse linear programming problems.