Simplex algorithm: Difference between revisions
Content deleted Content added
No edit summary |
Added {{no sources}} tag to article (TW) |
||
| Line 1: | Line 1: | ||
{{no sources|date=September 2015}} |
|||
[[File:Simplex-method-3-dimensions.png|thumb|The red line is one solution of the problem.]] |
[[File:Simplex-method-3-dimensions.png|thumb|The red line is one solution of the problem.]] |
||
The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[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 algorithm runs in two steps: |
The '''Simplex algorithm''' is an [[algorithm]] which is used to solve problems of [[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 algorithm runs in two steps: |
||
Latest revision as of 01:02, 1 September 2015
 | This article does not have any sources. (September 2015) |
The Simplex algorithm is an algorithm which is used to solve problems of 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 algorithm runs in two steps:
- First a solution to the problem is found, or the certainty that no solution exists.
- The solution found earlier is improved, if this is possible.
Step 2 is run multiple times: Each time, a given solution is improved, until this is no longer possible.
