Simplex Solution Procedure

1. Determine which variable to enter into the solution mix next. One way of doing this is by
identifying the column, and hence the variable, with the largest positive number in the Cj
− Zj row of the preceding tableau. The column identified in this step is called the pivot
column.
2. Determine which variable to replace. Decide which basic variable currently in the
solution will have to leave to make room for the new variable. Divide each amount in the
quantity column by the corresponding number in the column selected in step 1. The
row with the smallest nonnegative number calculated in this fashion will be replaced in
the next tableau. This row is often referred to as the pivot row. The number at the
intersection of the pivot row and pivot column is referred to as the pivot number.
3. Compute new values for the pivot row by dividing every number in the row by the pivot
number.
4. Compute the new values for each remaining row. All remaining row(s) are calculated as
follows:

5. Compute the Zj and Cj − Zj rows, as demonstrated in the initial tableau. If all numbers in
the Cj − Zj row are 0 or negative, an optimal solution has been reached. If this is not the
case, return to step 1.

Setting up the initial simplex solution

Maximise profit = 7x1 + 6x2 (objective function)
subject to x1 + x2 ≤ 4
2x1 + x2 ≤ 6
x1, x2 ≥ 0 (nonnegativity constraints)

Rewrite the formulation – in simplex terms:

Maximise profit = 7x1 + 6x2 + 0S1 + 0S2 (objective function)
subject to x1 + x2 + 1S1 + 0S2 = 4
2x1 + x2 + 0S1 + 1S2 = 6
Initial/First Simplex Tableau

Cj 7 6 0 0
SOLUTION MIX x1 x2 S1 S2 QUANTITY

$0 S1 1 1 1 0 4/1 = 4

$0 S2 2 1 0 1 6/2 = 3
Zj 0 0 0 0 0
Cj – Zj 7 6 0 0

Second Simplex Tableau

Cj 7 6 0 0
SOLUTION MIX x1 x2 S1 S2 QUANTITY

$0 S1 0 0.5 1 -0.5 1/0.5 = 2

$7 x1 1 0.5 0 0.5 3/0.5 = 6

Zj 7 3.5 0 3.5 21
Cj – Zj 0 2.5 0 -3.5

Third Simplex Tableau

Cj 7 6 0 0
SOLUTION MIX x1 x2 S1 S2 QUANTITY

$6 x2 0 1 2 -1 2

$7 x1 1 0 -1 1 2
Zj 7 6 5 1 26
Cj – Zj 0 0 -5 -1