Big-M Method

Work in progress. This note is still being written and incomplete.

When the starting basis needs artificial variables, the Big-M method solves the LP in a single simplex run by penalizing artificial variables in the objective.

  • Assign each artificial variable a coefficient −M-M in the objective (maximization), where MM is an arbitrarily large positive constant.
  • Run the simplex algorithm normally. The penalty drives artificial variables out of the basis as the objective improves.

Reading the Result

  • Optimal solution
    All artificial variables are 0 in the optimal tableau.
  • Infeasible problem
    At least one artificial variable remains positive (basic with a non-zero value) in the optimal tableau.
  • Unbounded problem
    Detected by the usual minimum ratio test, same as without artificial variables.

Worked Example

minimizez=4x1+x2subject to3x1+x2=34x1+3x2≥6x1+2x2≤4x1,x2≥0(1)\begin{aligned} \text{minimize} \quad & z = 4x_1 + x_2 \\ \text{subject to} \quad & 3x_1 + x_2 = 3 \\ & 4x_1 + 3x_2 \ge 6 \\ & x_1 + 2x_2 \le 4 \\ & x_1, x_2 \ge 0 \end{aligned} \tag{1}

Standard form adds a surplus s2s_2 to the ≥\ge constraint, a slack s3s_3 to the ≤\le constraint, and artificials a1,a2a_1, a_2 to the equality and ≥\ge rows:

3x1+x2+a1=34x1+3x2−s2+a2=6x1+2x2+s3=4(2)\begin{aligned} 3x_1 + x_2 + a_1 &= 3 \\ 4x_1 + 3x_2 - s_2 + a_2 &= 6 \\ x_1 + 2x_2 + s_3 &= 4 \end{aligned} \tag{2}

The tableau convention maximizes and stops when all objective row coefficients are ≥0\ge 0. Minimizing zz means maximizing −z-z, so the objective is max⁡ −z−Ma1−Ma2\max\ -z - M a_1 - M a_2. The natural starting basis is (a1,a2,s3)=(3,6,4)(a_1, a_2, s_3) = (3, 6, 4), read straight off (2)(2).

1 /

entering column leaving row pivot element updated this step

Basis (a1,a2,s3)=(3,6,4)(a_1, a_2, s_3) = (3, 6, 4). But a1,a2a_1, a_2 are basic with a nonzero coefficient MM in the objective row, so it isn’t canonical yet: subtract M×(a1 row)M \times (a_1 \text{ row}) and M×(a2 row)M \times (a_2 \text{ row}) from the objective row to zero them out.

Objective row after eliminating a1,a2a_1, a_2. Its RHS is the value of the maximand −z-z; negate it for zz. For large MM the coefficients 4−7M4 - 7M and 1−4M1 - 4M are both negative, so not optimal.

Most negative coefficient is 4−7M4 - 7M, so x1x_1 enters. Minimum ratio is 11 in row a1a_1, so a1a_1 leaves. Pivot element is 33.

Coefficient (−1−5M)/3(-1 - 5M)/3 is the most negative, so x2x_2 enters. Minimum ratio is 1.21.2 in row a2a_2, so a2a_2 leaves. Pivot element is 5/35/3.

Both artificials are non-basic. Only −1/5-1/5 (column s2s_2) is negative, so s2s_2 enters. Minimum ratio is 11 in row s3s_3, so s3s_3 leaves. Pivot element is 11.

All objective coefficients are non-negative and no artificial is basic. Optimal at x1=2/5x_1 = 2/5, x2=9/5x_2 = 9/5, maximand −z=−17/5-z = -17/5, so z=17/5=3.4z = 17/5 = 3.4.

Written by September 28, 2026 2 min read
Was this helpful?