The Big M method is a technique used in linear programming to solve problems involving artificial variables. It addresses scenarios where the initial feasible solution isn’t readily apparent due to constraints like “greater than or equal to” or “equal to.” Artificial variables are introduced into these constraints, and a large positive constant (the “Big M”) is assigned as a coefficient in the objective function to penalize these artificial variables, encouraging the solution algorithm to drive them to zero. For example, a constraint like x + y 5 might become x + y – s + a = 5, where ‘s’ is a surplus variable and ‘a’ is an artificial variable. In the objective function, a term like +Ma would be added (for minimization problems) or -Ma (for maximization problems).
This approach offers a systematic way to initiate the simplex method, even when dealing with complex constraint sets. Historically, it provided a crucial bridge before more specialized algorithms for finding initial feasible solutions became prevalent. By penalizing artificial variables heavily, the method aims to eliminate them from the final solution, leading to a feasible solution for the original problem. Its strength lies in its ability to handle diverse types of constraints, ensuring a starting point for optimization regardless of initial conditions.
