Big M method is a method to find the feasible solution of the initial basis of linear programming problem after using artificial variable method when the constraint condition (=) equation or (≥) is greater than type.

brief introduction

After adding artificial variables to the constraints of linear programming problems, it is required to add terms with m or m as coefficients to the objective function accordingly. In the maximization problem, the artificial variable is given an m as its coefficient.

In the minimization problem, an artificial variable is given an m as its coefficient, and m is an arbitrarily large (not infinite) positive number. M is regarded as an algebraic symbol to participate in the operation and solved by simplex method, so this method is called big M method.