Module SPLP in SLATECSolve linear programming problems involving at most a few thousand constraints and variables. Takes advantage of sparsity in the constraint matrix.
CALL SPLP (USRMAT, MRELAS, NVARS, COSTS, PRGOPT, DATTRV, BL, BU, IND, INFO, PRIMAL, DUALS, IBASIS, WORK, LW, IWORK, LIW)| G2a2 | Linear programming with a sparse matrix of constraints |