Enrichment Exercise 3.

4 (Page 78)

1. Maximize: P = 10x1 + 20x2

Subject to: 2x1 + 4x2 ≤ 20
4x1 + 3x2 ≥ 10
9x1 + 3x2 = 33
X1 ≥ 0, x2 ≥ 0

Represent 9x1 + 3x2 = 33 by two inequalities 9x1 + 3x2 ≥ 33 and 9x1 + 3x2 ≤ 33.

The new LP model would be:

Maximize: P = 10x1 + 20x2

Subject to: 2x1 + 4x2 ≤ 20
4x1 + 3x2 ≥ 10
9x1 + 3x2 ≥ 33
9x1 + 3x2 ≤ 33
X1 ≥ 0, x2 ≥ 0

Let Sn represents the slack variables.

2x1 + 4x2 + S1 = 20
4x1 + 3x2 – S 2 = 10
9x1 + 3x2 – S3 = 33
9x1 + 3x2 + S4 = 33
-10x1 - 20x2 + P = 0
Tableau 1
BV x1 x2 S1 S2 S3 S4 P RHS

S1 2 4 1 0 0 0 0 20

S2 4 3 0 -1 0 0 0 10

S3 9 3 0 0 -1 0 0 33

S4 9 3 0 0 0 1 0 33

P -10 -20 0 0 0 0 1 0
Online calculator: Simplex Method linprog.com
Answer: P = 100
x1 = 2.4, x2 = 3.8

2. Maximize: P = 36x1 + 21x2

Subject to: 9x1 + 5x2 ≤ 320
x1 + 3x2 ≥ 60
 2x1 + 2x2 ≤ 33
X1 ≥ 0, x2 ≥ 0

Let Sn represents the slack variables.

9x1 + 5x2 + S1 = 320
x1 + 3x2 – S2 = 60
2x1 + 2x2 + S3 = 96
-36x1 - 21x2 + P = 0
Tableau 1
BV x1 x2 S1 S2 S3 P RHS
S1 9 5 1 0 0 0 320
S2 1 3 0 -1 0 0 60
S3 2 2 0 0 1 0 96
P -36 -21 0 0 0 1 0
Online calculator: Simplex Method linprog.com
Answer: P = 1,308
x1 = 20, x2 = 28
 3. Minimize: C = 5x1 + 2x2
Subject to: 6x1 + x2 ≥ 18
6x1 + 3x2 ≤ 30
2x1 + 8x2 ≤ 20
X1 ≥ 0, x2 ≥ 0

Let Sn represents the surplus variables.

-6x1 - x2 + S1 = -18
6x1 + 3x2 + S2 = 30
2x1 + 8x2 + S3 = 20
5x1 + 2x2 + P = 0
Tableau 1
BV x1 x2 S1 S2 S3 P RHS
S1 -6 -1 1 0 0 0 -18
S2 6 3 0 1 0 0 30
S3 2 8 0 0 1 0 20
P 5 2 0 0 0 1 0
Online calculator: Simplex Method linprog.com
Answer: C = 15
x1 = 3, x2 = 0