Linear Programming (Simplex)

Uses the simplex algorithm to solve small scale linear programming problems. Includes features for setting constraint types, tolerances, pivoting rules, and returns extensive output information, including dual variables, state of each constraint, uniqueness and quality of the solution, final basis, and whether there are multiple optimal solutions.

The GAUSS Application - Linear Programming is provided in GAUSS source code, allowing the user flexibility to customize and extend it's capabilities.

Greg Mead

Sales Manager