Class G2a1 ... Linear programming with a dense matrix of constraints

• Parent class.
• Top of Tree

Modules for class G2a1

• DDLPRS (DLPRS) Solve a linear programming problem via the revised simplex algorithm.
• DLPRS (DDLPRS) Solve a linear programming problem via the revised simplex algorithm.

• E04MFF Solves general linear programming problems. Not intended for large sparse proble ...
• E04NCF Solves linearly constrained linear least-squares problems and convex quadratic p ...
• E04NFF Solves general quadratic programming problems. Not intended for large sparse pro ...
• H02BFF Solves linear or integer programming problems specified in MPSX input format. No ...
• H02CBF Solves general quadratic programming problems with integer constraints on the va ...

• NAG_OPT_LIN_LSQ Solves linearly constrained linear least-squares problems and convex quadratic p ...
• NAG_OPT_LP Solves general linear programming problems. It is not intended for large sparse ...
• NAG_OPT_QP Solves general quadratic programming problems. It is not intended for large spar ...

• 557 PAGP: a partitioning algorithm for linear goal programming problems. (See J.L. A ...