What is Simplex algorithm?
{{no sources|date=September 2015}} [[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: #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. {{multistub|math|tech}} [[Category:Combinatorial optimization]]