Solution:

𝑂𝑏𝑗𝑒𝑐𝑡𝑖𝑣𝑒 Z = (12 − 2)𝑥1 + (8 − 1) 𝑥2 − (𝑥1 + 2𝑥2 ) × 1 − (3𝑥1 + 𝑥2 ) × 2

max 𝑍 = 3𝑥1 + 3 𝑥2

s. t. 𝑥1 + 2 𝑥2 ≤ 15

3𝑥1 + 𝑥2 ≤ 26

4𝑥1 ≤ 32

3𝑥2 ≤ 15

𝑥1 , 𝑥2 ≥ 0

Introduce 𝑠1 , 𝑠2 , 𝑠3 , 𝑠4 :

max 𝑍 = 3𝑥1 + 3 𝑥2

s. t. 𝑥1 + 2 𝑥2 + 𝑠1 = 15

3𝑥1 + 𝑥2 + 𝑠2 = 26

4𝑥1 + 𝑠3 = 32

3𝑥2 + 𝑠4 = 15

𝑥1 , 𝑥2 , 𝑠1 , 𝑠2 , 𝑠3 , 𝑠4 = 0

Tableau Basis 𝑥1 𝑥2 𝑠1 𝑠2 𝑠3 𝑠4 Value Ratio

cj 3 3 0 0 0 0
𝑠1 0 1 2 1 0 0 0 15 15

𝑠2 0 3 1 0 1 0 0 26 26/3

𝑠3 0 4 0 0 0 1 0 32 8
1st
𝑠4 0 0 3 0 0 0 1 15 -

zj 0 0 0 0 0 0 0

cj -zj 3 3 0 0 0 0

𝑠1 0 0 2 1 0 -1/4 0 7 7/2

𝑠2 0 0 1 0 1 -3/4 0 2 2

𝑥1 3 1 0 0 0 1/4 0 8 -
2nd
𝑠4 0 0 3 0 0 0 1 15 5

zj 3 0 0 0 3/4 0 24

cj -zj 0 3 0 0 -3/4 0
 𝑠1 0 0 0 1 -2 5/4 0 3 12/5

𝑥2 3 0 1 0 1 -3/4 0 2 -

𝑥1 3 1 0 0 0 1/4 0 8 32
3rd
𝑠4 0 0 0 0 -3 9/4 1 9 4
zj 3 3 0 3 -3/2 0 30

cj -zj 0 0 0 -3 3/2 0

𝑠3 0 0 0 4/5 -8/5 1 0 12/5

𝑥2 3 0 1 3/5 -1/5 0 0 19/5

𝑥1 3 1 0 -1/5 2/5 0 0 37/5

4th
𝑠4 0 0 0 -9/5 3/5 0 1 18/5

zj 3 3 6/5 3/5 0 0 168/5

cj -zj 0 0 -6/5 -3/5 0 0

The optimal solution is: 𝑥1∗ = 37/5, 𝑥2∗ = 19/5, 𝑧 ∗ = 168/5

Graphical Method:
Simplex Method without Tabular:

# 1:

Step 1: Check feasible solution

Let slack variables be basic variables: 𝑠1 , 𝑠2 , 𝑠3 , 𝑠4 are the basic variables; 𝑥1 , 𝑥2 are the non-basic
variables.

𝐵0 = {𝑠1 , 𝑠2 , 𝑠3 , 𝑠4 }

If 𝑥1 and 𝑥2 are 0, then:

𝑠1 = 15 − 𝑥1 − 2 𝑥2 = 15 > 0

𝑠2 = 26 − 3𝑥1 − 𝑥2 = 26 > 0

𝑠3 = 32 − 4𝑥1 = 32 > 0

𝑠4 = 15 − 3𝑥2 = 15 > 0

𝑍 = 3𝑥1 +3 𝑥2 = 0

This basic solution (0, 0, 15, 26, 32, 15) is feasible.

Step 2: Check optimal solution

The coefficient of the non-basic variables (𝑥1 , 𝑥2 ) are 3 and 3, which are positive. So, the basic solution is not
optimal.

Step 3: Determine entering and leaving variables

𝑥1 is a non-basic variable with a positive coefficient. So, it is the entering variable.

𝑠1 = 15 − 𝑥1 − 2𝑥2 ≥ 0 requires 𝑥1 ≤ 15

𝑠2 = 26 − 3𝑥1 − 𝑥2 ≥ 0 requires 𝑥1 ≤ 26/3

𝑠3 = 32 − 4𝑥1 ≥ 0 requires 𝑥1 ≤ 8

𝑠4 = 15 − 3𝑥2 ≥ 0

Hence 𝑠3 is the leaving variable, which is the one that first goes to zero as the value of the entering variable 𝑥1
increases from zero.

Step 4: Develop new simplex pivot

𝐵1 = {𝑠1 , 𝑠2 , 𝑥1 , 𝑠4 } 𝑥1 = (32 − 𝑠3 )/4

𝑠1 = 15 − (32 − 𝑠3 )/4 − 2 𝑥2 = 7 + 𝑠3 /4 − 2𝑥2

𝑠2 = 26 − 3 × (32 − 𝑠3 )/4 − 𝑥2 = 2 + 3/4𝑠3 − 𝑥2

𝑥1 = (32 − 𝑠3 )/4 = 8 − 𝑠3 /4

𝑠4 = 15 − 3𝑥2

𝑍 = 3 × (32 − 𝑠3 )/4 +3 𝑥2 = 24 − 3/4𝑠3 + 3𝑥2

------------------------------------------------------------------------------

# 2:

Step 1: Check feasible solution

𝐵1 = {𝑠1 , 𝑠2 , 𝑥1 , 𝑠4 }

If 𝑠3 and 𝑥2 are 0, then:

𝑠1 = 7 + 𝑠3 /4 − 2𝑥2 = 7 > 0

𝑠2 = 2 + 3/4𝑠3 − 𝑥2 = 2 > 0

𝑥1 = 8 − 𝑠3 /4 = 8 > 0

𝑠4 = 15 − 3𝑥2 = 15 > 0

𝑍 = 3 × (32 − 𝑠3 )/4 +3 𝑥2 = 24 − 3/4𝑠3 + 3𝑥2 = 24

This basic solution (8, 0, 7, 2, 0, 15) is feasible.

Step 2: Check optimal solution

The coefficient of the non-basic variable 𝑥2 is 3, which is positive. So, the basic solution is not optimal.

Step 3: Determine entering and leaving variables

𝑥2 is a non-basic variable with a positive coefficient. So, it is the entering variable.

𝑠1 = 7 + 𝑠3 /4 − 2𝑥2 ≥ 0 requires 𝑥2 ≤ 7/2

𝑠2 = 2 + 3/4𝑠3 − 𝑥2 ≥ 0 requires 𝑥2 ≤ 2

𝑥1 = 8 − 𝑠3 /4 = 8
𝑠4 = 15 − 3𝑥2 ≥ 0 requires 𝑥2 ≤ 5

Hence 𝑠2 is the leaving variable, which is the one that first goes to zero as the value of the entering variable 𝑥2
increases from zero.

Step 4: Develop new simplex pivot

𝐵2 = {𝑠1 , 𝑥2 , 𝑥1 , 𝑠4 } 𝑥2 = 2 + 3/4𝑠3 − 𝑠2

𝑠1 = 7 + 𝑠3 /4 − 2 × (2 + 3/4𝑠3 − 𝑠2 ) = 3 − 5/4𝑠3 + 2𝑠2

𝑥2 = 2 + 3/4𝑠3 − 𝑠2

𝑥1 = 8 − 𝑠3 /4

𝑠4 = 15 − 3 × (2 + 3/4𝑠3 − 𝑠2 ) = 9 − 9/4𝑠3 + 3𝑠2

𝑍 = 24 − 3/4𝑠3 + 3 × (2 + 3/4𝑠3 − 𝑠2 ) = 30 + 3/2𝑠3 − 3𝑠2

------------------------------------------------------------------------------

# 3:

Step 1: Check feasible solution

𝐵2 = {𝑠1 , 𝑥2 , 𝑥1 , 𝑠4 }

If 𝑠3 and 𝑠2 are 0, then:

𝑠1 = 3 − 5/4𝑠3 + 2𝑠2 = 3 > 0

𝑥2 = 2 + 3/4𝑠3 − 𝑠2 = 2 > 0

𝑥1 = 8 − 𝑠3 /4 = 8 > 0

𝑠4 = 9 − 9/4𝑠3 + 3𝑠2 = 9 > 0

𝑍 = 30 + 3/2𝑠3 − 3𝑠2 = 30

This basic solution (8, 2, 3, 0, 0, 9) is feasible.

Step 2: Check optimal solution

The coefficient of the non-basic variable 𝑠3 is 3/2, which is positive. So, the basic solution is not optimal.
Step 3: Determine entering and leaving variables

𝑠3 is a non-basic variable with a positive coefficient. So, it is the entering variable.

𝑠1 = 3 − 5/4𝑠3 + 2𝑠2 ≥ 0 requires 𝑠3 ≤ 12/5

𝑥2 = 2 + 3/4𝑠3 − 𝑠2 ≥ 0

𝑥1 = 8 − 𝑠3 /4 ≥ 0 requires 𝑠3 ≤ 32

𝑠4 = 9 − 9/4𝑠3 + 3𝑠2 ≥ 0 requires 𝑠3 ≤ 4

Hence 𝑠1 is the leaving variable, which is the one that first goes to zero as the value of the entering variable 𝑠3
increases from zero.

Step 4: Develop new simplex pivot

𝐵3 = {𝑠3 , 𝑥2 , 𝑥1 , 𝑠4 } 𝑠3 = 12/5 − 4/5𝑠1 + 8/5𝑠2

𝑠3 = 12/5 − 4/5𝑠1 + 8/5𝑠2

𝑥2 = 2 + 3/4 × (12/5 − 4/5𝑠1 + 8/5𝑠2 ) − 𝑠2 = 19/5 − 3/5𝑠1 + 1/5𝑠2

𝑥1 = 8 − (12/5 − 4/5𝑠1 + 8/5𝑠2 )/4 = 37/5 + 1/5𝑠1 − 2/5𝑠2

𝑠4 = 9 − 9/4 × (12/5 − 4/5𝑠1 + 8/5𝑠2 ) + 3𝑠2 = 18/5 + 9/5𝑠1 − 3/5𝑠2

𝑍 = 30 + 3/2 × (12/5 − 4/5𝑠1 + 8/5𝑠2 ) − 3𝑠2 = 168/5 − 6/5𝑠1 − 3/5𝑠2

------------------------------------------------------------------------------

# 4:

Step 1: Check feasible solution

𝐵3 = {𝑠3 , 𝑥2 , 𝑥1 , 𝑠4 }

If 𝑠1 and 𝑠2 are 0, then:

𝑠3 = 12/5 − 4/5𝑠1 + 8/5𝑠2 = 12/5

𝑥2 = 19/5 − 3/5𝑠1 + 1/5𝑠2 = 19/5

𝑥1 = 37/5 + 1/5𝑠1 − 2/5𝑠2 = 37/5

𝑠4 = 18/5 + 9/5𝑠1 − 3/5𝑠2 = 18/5

𝑍 = 168/5 − 6/5𝑠1 − 3/5𝑠2 = 168/5

This basic solution (37/5, 19/5, 0, 0, 12/5, 18/5) is feasible.

Step 2: Check optimal solution

The coefficients of the non-basic variables are negative. So, the basic solution is optimal.

The optimal solution is 𝑥1∗ = 37/5, 𝑥2∗ = 19/5, 𝑧 ∗ = 168/5