Simplex algorithm: Difference between revisions

The Simplex algorithm is an algorithm which is used to solve problemsof Linear programming or linear optimization. It was first used by George Dantzig in 1947, but other people like Kantorovich laid the foundations in 1939. The alfgorithm runs in two distinct steps:

1. First a solution to the problem is found, or the certainity that no solution exists.
2. The solution found is improved.

Phase 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.

This short article can be made longer. You can help Wikipedia by adding to it.