Reign Rouise V.

Gagalac 2nd Year BSA-A

Enrichment Exercise 3.2

1. Maximize: P = 15x1 + 18x2 + 9x3
Subject to: x1 + 2x2 ≤ 40
x1 + x2 ≤ 45
2x1 + x2 + x3 ≤ 100
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0

New Program:

Maximize: P = 15x1 + 18x2 + 9x3 + 0S1+ 0S2+ 0S3

x1 + 2x2 + S1 = 40
x1 + x2 + S2 = 45
2x1 + x2 + x3 + + S3 = 100
-15x1 -18x2 - 9x3 - 0S1 - 0S2 - 0S3 + P = 0
Tableau

BV X1 X2 X3 S1 S2 S3 P RHS

S1 1 2 0 1 0 0 0 40 1st Cons.

S2 1 1 0 0 1 0 0 45 2nd Cons.

S3 2 1 1 0 0 1 0 100 3rd Cons.

P -15 -18 -9 0 0 0 1 0 Obj. Func

Reign Rouise V. Gagalac 2nd Year BSA-A
 Reign Rouise V. Gagalac 2nd Year BSA-A

Online calculator: Simplex Method linprog.com

Answer: x1 = 0, x2 = 20, x3 = 80
P = 1,080
 Reign Rouise V. Gagalac 2nd Year BSA-A

2. Maximize: P = 12x1 + 8x2 + 4x3

Subject to: 2x1 + x2 ≤ 40
x1 + 2x3 ≤ 30
2x2 + 2x3 ≤ 30
x1 ≥ 0, x2 ≥ 0, x3 ≥ 0

New Program:

Maximize: P = 12x1 + 8x2 + 4x3 + 0S1+ 0S2+ 0S3

2x1 + x2 + S1 = 40
x1 + 2x3 + S2 = 30
2x2 + 2x3 + S3 = 30
-12x1 - 8x2 - 4x3 - 0S1 - 0S2 - 0S3 + P = 0
TABLEAU

BV X1 X2 X3 S1 S2 S3 P RHS

S1 2 1 0 1 0 0 0 40 1st Cons.

S2 1 0 2 0 1 0 0 30 2nd Cons.

S3 0 2 2 0 0 1 0 30 3rd Cons.

P -12 -8 -4 0 0 0 1 0 Obj. Func

Reign Rouise V. Gagalac 2nd Year BSA-A
Reign Rouise V. Gagalac 2nd Year BSA-A
 Reign Rouise V. Gagalac 2nd Year BSA-A

Online calculator: Simplex Method linprog.com

Answer: x1 =16, x2 = 8, x3 = 7
P = 284
 Reign Rouise V. Gagalac 2nd Year BSA-A

Enrichment Exercise 3.3

1. Minimize: C = 9x1 + 5x2

Subject to: 2x1 + x2 ≥ 11
x1 + x2 ≥ 10
x1 ≥ 0, x2 ≥ 0

Convert to:
Maximize: P = -9x1 - 5x2
The constraints are:
2x1 + x2 ≥ 11
x1 + x2 ≥ 10
x1 ≥ 0, x2 ≥ 0

New Program:

Maximize: P = -9x1 - 5x2 - 0S1 - 0S2

2x1 + x2 - S1 = 11
x1 + x2 - S2 = 10
9x1 +5x2 + 0S1 + 0S2 + P = 0
TABLEAU

BV X1 X2 S1 S2 P RHS

S1 2 1 -1 0 0 11 1st Cons.

S2 1 1 0 -1 10 10 2nd Cons.

P 9 5 0 0 1 0 Obj. Func
Reign Rouise V. Gagalac 2nd Year BSA-A
 Reign Rouise V. Gagalac 2nd Year BSA-A

Online calculator: Simplex Method linprog.com

Answer: x1 = 1, x2 = 9
C = 54
 Reign Rouise V. Gagalac 2nd Year BSA-A

2.) Minimize: C = 8x1 + 4x2

Subject to: 5x1 + 3x2 ≥ 10
5x1 + x2 ≥ 5
x1 ≥ 0, x2 ≥ 0

Convert to:
Maximize: P = -8x1 - 4x2
The constraints are:
5x1 + 3x2 ≥ 10
5x1 + x2 ≥ 5
x1 ≥ 0, x2 ≥ 0

New Program:

Maximize: P = -8x1 - 4x2 - 0S1 - 0S2

5x1 + 3x2 - S1 = 10
5x1 + x2 - S2 = 5
8x1 + 4x2 + 0S1 + 0S2 + P = 0

TABLEAU

BV X1 X2 S1 S2 P RHS

S1 5 3 -1 0 0 10 1st Cons.

S2 5 1 0 -1 0 5 2nd Cons.

P 8 4 0 0 1 0 Obj. Func
Reign Rouise V. Gagalac 2nd Year BSA-A
 Reign Rouise V. Gagalac 2nd Year BSA-A

nline calculator: Simplex Method linprog.com

Answer: x1 = 0.5, x2 = 2.5
C = 14