Module SLPRS in IMSLMSolves sparse linear programming problems via the revised simplex algorithm. (Based on DPLO by Hanson and Hiebert.).
CALL SLPRS (M, NVAR, NZ, A, IROW, JCOL, BL, BU, C, IRTYPE, XLB, XUB, OBJ, XSOL, DSOL)| G2a2 | Linear programming with a sparse matrix of constraints |