Linear Programming Simplex method was designed by ans.DantzigHungarianLemke A.Charnes Previous Marked for Review Next

The Linear Programming Simplex method was designed by George Dantzig. He developed this algorithm in the 1940s as a solution to optimization problems, specifically to maximize or minimize a linear objective function subject to linear equality and inequality constraints. The Simplex method iteratively moves along the edges of a feasible region defined by the constraints, enhancing the objective function at each step, until it reaches the optimal solution.

Dantzig's contribution to linear programming and operations research has been fundamental, and his work laid the groundwork for many subsequent developments in optimization theory and its applications in various fields, including economics, engineering, military logistics, and transportation.

In summary, the correct answer to the question regarding who designed the Simplex method is George Dantzig.