Chained Vector Simplex

An algorithm for solving linear programming problems whose matrix of coefficients contains a large number of "zero" entries is studied. This algorithm is more useful when it is generated as a sub-program in a real-time program. The singly linked lists for storing only the non-zero entries of the coefficients matrix is used. The modified Revised Simplex Method is also used for solving such problems because of its advantages.