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 in the objective (maximization), where M 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.
The tableau convention maximizes and stops when all objective row coefficients are ≥0. Minimizing z means maximizing −z, so the objective is max−z−Ma1−Ma2. The natural starting basis is (a1,a2,s3)=(3,6,4), read straight off (2).
1 /
entering column leaving row pivot element updated this step
Basic
x1
x2
s2
s3
a1
a2
RHS
Ratio
z
4
1
0
0
M
M
0
a1
3
1
0
0
1
0
3
a2
4
3
−1
0
0
1
6
s3
1
2
0
1
0
0
4
Basis (a1,a2,s3)=(3,6,4). But a1,a2 are basic with a
nonzero coefficient M in the objective row, so it isn’t canonical yet:
subtract M×(a1 row) and M×(a2 row)
from the objective row to zero them out.
Basic
x1
x2
s2
s3
a1
a2
RHS
Ratio
z
4−7M
1−4M
M
0
0
0
−9M
a1
3
1
0
0
1
0
3
a2
4
3
−1
0
0
1
6
s3
1
2
0
1
0
0
4
Objective row after eliminating a1,a2. Its RHS is the value of the
maximand −z; negate it for z. For large M the coefficients 4−7M and
1−4M are both negative, so not optimal.
Basic
x1
x2
s2
s3
a1
a2
RHS
Ratio
z
4−7M
1−4M
M
0
0
0
−9M
a1
3
1
0
0
1
0
3
3/3 = 1
a2
4
3
−1
0
0
1
6
6/4 = 1.5
s3
1
2
0
1
0
0
4
4/1 = 4
Most negative coefficient is 4−7M, so x1 enters. Minimum ratio is 1
in row a1, so a1 leaves. Pivot element is 3.
Basic
x1
x2
s2
s3
a1
a2
RHS
Ratio
z
0
(−1−5M)/3
M
0
(7M−4)/3
0
−2M−4
x1
1
1/3
0
0
1/3
0
1
1 / (1/3) = 3
a2
0
5/3
−1
0
−4/3
1
2
2 / (5/3) = 1.2
s3
0
5/3
0
1
−1/3
0
3
3 / (5/3) = 1.8
Coefficient (−1−5M)/3 is the most negative, so x2 enters. Minimum ratio
is 1.2 in row a2, so a2 leaves. Pivot element is 5/3.
Basic
x1
x2
s2
s3
a1
a2
RHS
Ratio
z
0
0
−1/5
0
M−8/5
1/5+M
−18/5
x1
1
0
1/5
0
3/5
−1/5
3/5
(3/5) / (1/5) = 3
x2
0
1
−3/5
0
−4/5
3/5
6/5
skip (-3/5)
s3
0
0
1
1
1
−1
1
1/1 = 1
Both artificials are non-basic. Only −1/5 (column s2) is negative, so
s2 enters. Minimum ratio is 1 in row s3, so s3 leaves. Pivot
element is 1.
Basic
x1
x2
s2
s3
a1
a2
RHS
Ratio
z
0
0
0
1/5
M−7/5
M
−17/5
x1
1
0
0
−1/5
2/5
0
2/5
x2
0
1
0
3/5
−1/5
0
9/5
s2
0
0
1
1
1
−1
1
All objective coefficients are non-negative and no artificial is basic.
Optimal at x1=2/5, x2=9/5, maximand −z=−17/5, so
z=17/5=3.4.
Step-by-step walkthrough of the simplex method on a tableau