Big M method
Method of solving linear programming problems / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Big M method?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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 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.
This article needs attention from an expert in Mathematics. See the talk page for details. (March 2011) |