What is Difference between simplex and big M method
Answers
Answered by
0
The simplex method is the method used for linear programming and is developed by George Dantzig in year 1947.
Big m method is the more advanced method of solving problems of linear programming . it used the simplex method and increase its power to solve problems.
Similar questions