[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

Class G2a2 ... Linear programming with a sparse matrix of constraints

Modules for class G2a2

Package CMLIB at ITL|ARNO

SPLP Solves linear optimization problems, that is, it minimizes the linear function ( ...

DSLPRS (SLPRS) Solves sparse linear programming problems via the revised simplex algorithm. (Ba ...
SLPRS (DSLPRS) Solves sparse linear programming problems via the revised simplex algorithm. (Ba ...

Package NAG at ITL|AIX

E04NKF Solves sparse linear programming or quadratic programming problems.
E04UGF Solves sparse nonlinear programming problems. .
H02CEF Obtains integer solutions to sparse linear programming and quadratic programming ...

NAG_OPT_NLP_SPARSE Solves sparse nonlinear programming problems.
NAG_OPT_SPARSE_CONVEX_QP Solves sparse linear programming or convex quadratic programming problems.

Package OPT at NETLIB

BPMPD Solves large sparse linear programming problems by an interior-point method. Pro ...
HOPDM Solves large-scale linear programs with a Higher Order Primal-Dual Method (HOPDM ...

Package SLATEC at ITL|ARNO

DSPLP (SPLP) Solve linear programming problems involving at most a few thousand constraints a ...
SPLP (DSPLP) Solve linear programming problems involving at most a few thousand constraints a ...

[Home] . . . Search by [Problem] [Package] [Module] [Keyword] . . . [Math at NIST]

This page was generated on Tue Sep 16, 2008 at 13:24:10 UTC