Dual Simplex

The dual simplex method allows solving linear programming problems, the constraint systems of which, with a positive basis, contain free terms of any sign. This method reduces the number of transformations of the constraint system, as well as the size of the simplex table.

Application Features

- Special keyboard for more convenient data entry;

- Full, step by step description of solutions;

- Ability to save decisions;

- Ability to edit saved solutions

- Works without access to the Internet

web version - https://linprog.com/main-dual-simplex