Simplex Method
2.6
Education | 3.5MB
Description
The simplex method is an algorithm for solving the optimization problem of linear programming. The problem of linear programming is that it is necessary to maximize or minimize some linear functional on a multidimensional space for given linear constraints.
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
Show More
Less
What's New Simplex Method
* Added the ability to save solutions and choose the interface language
* The number of equations and unknowns has been increased to 20.
* Added a special keyboard for more convenient data entry
* Added ability to edit saved solutions