xplain Big M method ?
shreya110:
hii
hello
Answers
Answered by
3
In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm. The Big M method extends the power of the simplex algorithm to problems that contain "greater-than" constraints. It does so by associating the constraints with large negative constants which would not be part of any optimal solution, if it exists.
Answered by
2
the Big M method is a method of solving linear programming problems using the simplex algorithm.
Similar questions