abstract:In operations research, the Big M method is a method of solving linear programming problems. It is a variation of the simplex method designed for solving problems typically encompassing "greater-than" constraints as well as "less-than" constraints - where the zero vector is not a feasible solution.