Overview
Linear Programming MT solves small- and large-scale linear programming problems in GAUSS.
- Exploit sparse matrices for large constraint systems.
- Import and work with MPS-formatted problems.
- Specify minimization or maximization, variable bounds, and equality or inequality constraints.
- Control tolerances, pivoting rules, and starting values.
- Inspect primal and dual values, constraint states, solution quality, and iteration reports.
View Linear Programming MT documentation Contact us about pricing
The documentation includes current capabilities, commands, installation guidance, and examples where available.