You are on page 1of 3

Simplex Method - Maximization

CJT Company, a sweets manufacturing business produces two kinds of flavored candies, apple and cherry.
The number of hours needed in order to make these products in each section are as follows. For apple, it has
2 hours in mixing section, 3 hours in molding section, and 2 hours in cooling section. Meanwhile, for cherry, it
has 4 hours, 5 hours, and 8 hours for mixing, molding, and cooling respectively. In addition, the capacity for
number of hours for each section are; 250 hours for mixing, 430 hours for molding, and 120 hours for cooling.
The profit per box is Php 20 for apple and Php 25 for cherry. Determine how many of each kind of flavored
candy should be made in order to maximize the profit.

Apple Cherry Capacity

Mixing Section 2 4 250

Molding Section 3 5 430

Cooling Section 2 8 120

Profit Php 20 Php 25

Maximize C= 20x1 + 25x2


Subject to:
2x1 + 4x2 ≤ 250
3x1 + 5x2 ≤ 430
2x1 + 8x2 ≤ 120

Solution: New Program with Slack Variable

Maximize C = 20x1 + 25x2


Subject to:
2x1 + 4x2 + S1 = 250
3x1 + 5x2 + S2 = 430
2x1 + 8x2 + S3 = 120
x1, x2, s1, s2, s3 ≥ 0

Cj 20 25 0 0 0

Prod Qty X1 X2 S1 S2 S3

0 S1 250 2 4 1 0 0

0 S2 430 3 5 0 1 0

0 S3 120 2 8 0 0 1

Zj 0 0 0 0 0 0
Cj-Zj 20 25 0 0 0

Minimum Ratio Test:

125
250/4 = 2

430/5 = 86

120/8 = 15 (min)

120 2 8 0 0 1 1 1
X2 = = 15 100
8 4 8

1 1
New S1 = 250 2 4 1 0 0 – (15 4
100 8
)*4

1
= 190 1 0 1 0 − 2
1 1
New S2 = 430 3 5 0 1 0 – (15 4
100 8
)*5

7 5
= 355 4 0 0 1 − 8

Cj 20 25 0 0 0

Prod Qty X1 X2 S1 S2 S3

1
0 S1 190 1 0 1 0 −2

7 5
0 S2 355 0 0 1 −8
4

1 1
25 X2 15 1 0 0
4 8

25 25
Zj 375 25 0 0
4 8

55 25
Cj-Zj 0 0 0 −
4 8

Minimum Ratio Test:

190/1 = 190

7 1420
355/4 = 7

1
15/4 = 60 (min)
1 1
15 1 0 0 1
4 8
X1 = 1 = 60 1 4 0 0
2
4

1 1
New S1 = 190 1 0 1 0 − 2 – (60 1 4 0 0 2
)*1

= 130 0 − 4 1 0 − 1
7 5 1 7
New S2 =355 4 0 0 1 − 8 – (60 1 4 0 0 2
)*4

3
= 250 0 -7 0 1− 2

Cj 20 25 0 0 0

Prod Qty X1 X2 S1 S2 S3

0 S1 130 0 -4 1 0 -1

3
0 S2 250 0 -7 0 1 −2

1
20 X1 60 1 4 0 0
2

Zj 1200 20 80 0 0 10

Cj-Zj 0 -55 0 0 -10

Decision:

X1 = 60

X2 = 0

Maximum C = 1200

You might also like