SIMPLEX METHOD

1. The Cannon Hill furniture Company produces tables and chairs. Each table takes
four hours of labor from the carpentry department and two hours of labor from the
finishing department. Each chair requires three hours of carpentry and one hour of
finishing. During the current week, 240 hours of carpentry time are available and
100 hours of finishing time. Each table produced gives a profit of $70 and each
chair a profit of $50. How many chairs and tables should be made?
Variables:
Let x1 – Tennis racket
Let x2 – Cricket bat

Department Tables (x1) Chairs (x2) Constraint

Carpentry (hr) 4x 3y ≤ 240
Finishing (hr) 2x y ≤ 100
Profit 70x 50y

Maximize P = 70x1 + 50x2

Subject to : 4x1 + 3x2 ≤ 240
2x1 + x2 ≤ 100
x1, x2 ≥ 0
Solution:
Maximize P = 70x + 50x2 + S1 + S2
Subject to : 4x1 + 3x2 + S1 = 240
2x1 + x2 + S2 = 100
x1, x2, S1 + S2 ≥ 0

Table 1

Cj 70 50 0 0
Product Quantity X1 X2 S1 S2
0 S1 240 4 3 1 0
 0 S2 100 2 1 0 1
Zj 0 0 0 0 0
Cj-Zj 70 50 0 0

MRT: 240 ÷ 4 = 60
100 ÷ 2 = 50

Entering Row (X1) = Leaving Row (S2) ÷ Pivot Element

100 2 1 0 1 ÷2
= 50 1 1 0 1
2 2

New S1 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
240 4 3 1 0
- 4 (50 1 1 0 1
2 2
40 0 1 1 -2

Table 2

Cj 70 50 0 0
Product Quantity X1 X2 S1 S2
0 S1 40 0 1 1 -2
1 1
70 X1 50 1 2 0 2
Zj 3500 70 35 0 35
Cj-Zj 0 15 1 -35

MRT: 40 ÷ 1 = 40

Entering Row (X2) = Leaving Row (S1) ÷ Pivot Element

40 0 1 1 -2 ÷1
 = 40 0 1 1 -2

New X1 = Old Row – (Pivot Column Old Row PCOR * Entering Row X2)
50 1 1 0 1
2 2
1 0 1 1 -2)
- (40
2
30 1 0 1 3
-
2 2

Table 3

Cj 70 50 0 0
Product Quantity X1 X2 S1 S2
40 0 1 1 -2
50 X2
1 3
-
70 X1 30 1 0 2 𝟐
Zj 4100 70 50 15 5
Cj-Zj 0 0 -15 -5

Decision:
x1 = 40
x2 = 30
Maximum P = 4,100

2. Mayflower furniture makes two products, beds and wardrobes, which must be
processed through assembly and finishing departments. Assembly has 60hrs
available and finishing has 48hrs. Each bed requires 4hrs in assembly and 2hrs in
finishing; each wardrobe requires 2hrs in assembly and 4hrs in finishing. If the
profit is $8 per bed and $6 per wardrobe, what is the best possible combination of
beds and wardrobes must Mayflower produce and sell to realize a maximum profit
given the constraints.
 Variables:
Let x1 – Beds
Let x2 – Wardrobes

Department Beds (x1) Wardrobes (x2) Constraint

Assembly 4x1 2y ≤ 60
Finishing 2x1 4y ≤ 48
Profit 8x1 6y

Maximize P = 8x1 + 6x2

Subject to : 4x1 + 2x2 ≤ 60
2x1 + 4x2 ≤ 48
x1, x2 ≥ 0

New Program with Slack Variable:

Maximize P = 8x1 + 6x2 + 0S1 + 0S2
Subject to : 4x1 + 2x2 + S1 = 60
2x1 + 4x2 + S2 = 48
x1, x2, S1, S2 ≥ 0

Table 1

Cj 8 6 0 0
Product Quantity X1 X2 S1 S2
0 S1 60 4 2 1 0
0 S2 48 2 4 0 1
Zj 0 0 0 0 0
Cj-Zj 8 6 0 0

MRT: 60 ÷ 4 = 15
 48 ÷ 2 = 24

Entering Row (X1) = Leaving Row (S1) ÷ Pivot Element

60 4 2 1 0 ÷4
1 1
= 15 1 2 4 0

New S2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)

48 2 4 0 1
1 1
- 2 (15 1 2 4 0)
1
-
18 0 3 2 1

Table 2

Cj 8 6 0 0
Product Quantity X1 X2 S1 S2
1 1
15 1 2 4 0
8 X1
1
18 0 3 - 1
0 S2 2

Zj 120 8 4 2 0
Cj-Zj 0 2 -2 0

MRT: 18 ÷ 3 = 6

Entering Row (X2) = Leaving Row (S1) ÷ Pivot Element

𝟏
- ÷3
18 0 3 𝟐 1
1 1
=6 0 1 - 3
6
New X1 = Old Row – (Pivot Column Old Row PCOR * Entering Row X2)
𝟏 𝟏
15 1 𝟐 𝟒 0
 𝟏 1
- (6 1 )
𝟐 0 1 - 3
6
1 1
-
12 1 0 3 6

Cj 8 6 0 0
Product Quantity X1 X2 S1 S2
1 1
-
12 1 0 3 6
8 X1
1 1
6 0 1 - 3
6 X2 6

Zj 4100 70 50 15 5
Cj-Zj 0 0 -15 -5

Decision:
x1 = 12
x2 = 6
Maximum P = 132

3. The Cut-Right Company sells sets of kitchen knives. The Basic Set consists of 2
utility knives and 1 chef’s knife. The Regular Set consists of 2 utility knives, 1
chef’s knife, and 1 slicer. The Deluxe Set consists of 3 utility knives, 1 chef’s knife,
and 1 slicer. The profit is $30 on a Basic Set, $40 on a Regular Set, and $60 on a
Deluxe Set. The factory has on hand 800 utility knives, 400 chef’s knives, and 200
slicers. Assuming that all sets will be sold, how many of each type should be made
up in order to maximize profit? What is the maximum profit?

Variables:
Let x1 – number of Basic Sets
Let x2 – number of Regular Sets
Let x3 – number of Deluxe Sets
 Basic (x1) Regular (x2) Deluxe (x3) Constraint
Utility’s Knives 2x1 2x2 3x3 ≤ 800
Chef’s Knives x1 x2 x3 ≤ 400
Slicer x2 x3 ≤ 200
Profit 30x1 40x2 60x3

Maximize P = 30x1 + 40x2 + 60x3

Subject to : 2x1 + 2x2 + 3x3 ≤ 800
x1 + x2 + x3 ≤ 400
x2 + x3 ≤ 200
x1, x2, x3 ≥ 0

New Program with Slack Variable:

Maximize P = 30x1 + 40x2 + 60x3 + 0S1 + 0S2 + 0S3
Subject to : 2x1 + 2x2 + 3x3 + S1 = 800
x1 + x2 + x3 + S2 = 400
x2 + x3 + S3 = 200
x1, x2, x3, S1, S2, S3 ≥ 0

Table 1

Cj 30 40 60 0 0 0
Product Quantity X1 X2 X3 S1 S2 S3
0 S1 800 2 2 3 1 0 0
0 S2 400 1 1 1 0 1 0
0 S3 200 0 1 1 0 0 1
Zj 0 0 0 0 0 0 0
Cj-Zj 30 40 60 0 0 0

MRT: 800 ÷ 3 = 267

 400 ÷ 1 = 400
200 ÷ 1 = 200

Entering Row (X3) = Leaving Row (S3) ÷ Pivot Element

200 0 1 1 0 0 1 ÷1
=200 0 1 1 0 0 1

New S1 = Old Row – (Pivot Column Old Row PCOR * Entering Row X3)
800 2 2 3 1 0 0
-1(200 0 1 1 0 0 1)
= 200 2 -1 0 1 0 -3

New S2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X3)
400 1 1 1 0 1 0
-1(200 0 1 1 0 0 1)
= 200 1 0 0 0 1 -1

Table 2

Cj 30 40 60 0 0 0
Product Quantity X1 X2 X3 S1 S2 S3
0 S1 200 2 -1 0 1 0 -3
0 S2 200 1 0 0 0 1 -1
60 x3 200 0 1 1 0 0 1
Zj 12,000 0 60 60 0 0 60
Cj-Zj 30 -20 0 0 0 -60

MRT: 200 ÷ 2 = 100

200 ÷ 1 = 200

Entering Row (X1) = Leaving Row (S1) ÷ Pivot Element

 200 2 -1 0 1 0 -3 ÷2
=100 1 1 0 1 0 3
- -
2 2 2

New S2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
200 1 0 0 0 1 -1
-1(100 1 1 0 1 0 3
- - )
2 2 2
= 100 0 1 0 1 1 1
-
2 2 2

New X3 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
200 0 1 1 0 0 1
-0(100 1 1 0 1 0 3
- - )
2 2 2

Table 3 = 200 0 1 1 0 0 1

Cj 30 40 60 0 0 0
Product Quantity X1 X2 X3 S1 S2 S3
30 x1 100 1 1 0 1 0 3
- -
2 2 2
0 S2 100 0 1 0 1 1 1
-
2 2 2
60 x3 200 0 1 1 0 0 1
Zj 42,000 30 45 60 15 0 15
Cj-Zj 0 -5 0 -15 0 -15

Decision:
x1 = 100
x2 = 0
x3 = 200
Maximum P = 42,000
 4. A company manufactures two types of novelty souvenirs made of plywood.
Souvenirs of type A require 5 minutes each for cutting and 10 minutes each for
assembling. Souvenirs of type B require 8 minutes each for cutting and 8 minutes
each for assembling. There are 3 hours 20 minutes available for cutting and 4
hours for assembling. The profit is P50 each for type A and P60 each for type B
souvenirs. How many souvenirs of each type should the company manufacture in
order to maximize the profit?

Variables:
Let x1 – Type A
Let x2 – Type B

Department Type A (x1) Type B (x2) Constraint

Cutting 4x1 8x2 ≤ 200
Assembly 10x1 8x2 ≤ 240
Profit 50x1 60x2

Maximize P = 50x1 + 60x2

Subject to : 5x1 + 8x2 ≤ 200
10x1 + 8x2 ≤ 240
x1, x2 ≥ 0

New Program with Slack Variable:

Maximize P = 50x1 + 60x2 + 0S1 + 0S2
Subject to : 5x1 + 8x2 + S1 = 60
10x1 + 8x2 + S2 = 48
x1, x2, S1, S2 ≥ 0

Table 1

Cj 50 60 0 0
Product Quantity X1 X2 S1 S2
0 S1 200 5 8 1 0
 0 S2 240 10 8 0 1
Zj 0 0 0 0 0
Cj-Zj 50 60 0 0

MRT: 200 ÷ 8 = 25
240 ÷ 8 = 30

Entering Row (X2) = Leaving Row (S1) ÷ Pivot Element

200 5 8 1 0 ÷8
5 1
=25 8 1 8 0

New S2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X2)

240 10 8 0 1
5 1
-8(25 8 1 8 0)

=40 5 0 -1 1

Table 2

Cj 50 60 0 0
Product Quantity X1 X2 S1 S2
5 1
60 X2 25 8 1 8 0
0 S2 40 5 0 -1 1
75 15
Zj 1500 2 60 2 0
𝟐𝟓 𝟏𝟓
Cj-Zj 𝟐 0 - 0
𝟐

MRT: 40 ÷ 5 = 8

Entering Row (X1) = Leaving Row (S2) ÷ Pivot Element

 40 5 0 -1 1 ÷5

1 1
=8 1 0 - 5
5

New X2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
𝟓 𝟏
25 𝟖 1 𝟖 0
𝟓 1
- (8 1 )
𝟖 1 0 - 5
5
1 1
20 0 1 -
4 8

Cj 50 60 0 0
Product Quantity X1 X2 S1 S2
1 1
-
20 0 1 4 8
60 X2
1 1
8 1 0 - 5
50 X1 5
5
2
Zj 1600 50 60 5
𝟓
Cj-Zj 0 0 -5 -
𝟐

Decision:
x1 = 8
x2 = 20
Maximum P = 1600
 5. A baker has 60 units of flour, 132 units of sugar, and 102 units of raisins. A loaf of
raisin bread requires 1 unit of flour, 1 unit of sugar, and 2 units of raisins, while a
raisin cake needs 2 units of flour, 4 units of sugar, and 1 unit of raisins. If raisin
bread sells for $3 a loaf, and raisin cake sells for $4, how many of each should be
baked to maximize gross income? What is the maximum gross income?

Variables:
Let x1 – Number of loaves of raisin bread
Let x2 – Number of raisin cakes

Beds (x1) Wardrobes (x2) Constraint

Flour x1 2x2 ≤ 60
Sugar x1 4x2 ≤ 132
Raisin 2x1 x2 ≤ 102
Profit 3x1 4x2

Maximize P = 3x1 + 4x2

Subject to : x1 + 2x2 ≤ 60
x1 + 4x2 ≤ 132
2x1 + 2x2 ≤ 102
x1, x2 ≥ 0

New Program with Slack Variable:

Maximize P = 3x1 + 4x2 + 0S1 + 0S2 + 0S3
Subject to : x1 + 2x2 + S1 = 60
x1 + 4x2 + S2 = 132
2x1 + 2x2 + S3 = 102
x1, x2, S1, S2 + S3 ≥ 0
 Table 1

Cj 3 4 0 0 0
Product Quantity X1 X2 S1 S2 S3
0 S1 60 1 2 1 0 0
0 S2 132 1 4 0 1 0
S3 102 2 2 0 0 1
Zj 0 0 0 0 0 0
Cj-Zj 3 4 0 0 0

MRT: 60 ÷ 4 = 30
132 ÷ 4 = 33
102 ÷ 2 = 51

Entering Row (X1) = Leaving Row (S1) ÷ Pivot Element

60 1 2 1 0 0 ÷2
1 1
= 30 2 1 2 0 0

New S2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
132 1 4 0 1 0
1 1
-4(30 2 1 2 0 0)

12 -1 0 -2 1 0

New S3 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
102 2 2 0 0 1
1 1
-4(30 2 1 2 0 0)

42 1 0 -1 0 1
 Table 2

Cj 3 4 0 0 0
Product Quantity X1 X2 S1 S2 S3
1 1
4 X2 30 2 1 2 0 0
12 -1 0 -2 1 0
0 S2
0 S3 42 1 0 -1 0 1

Zj 120 2 4 2 0 0
Cj-Zj 1 0 -2 0 0

MRT: 42 ÷ 1 = 42

Entering Row (X1) = Leaving Row (S3) ÷ Pivot Element

42 1 0 -1 0 1 ÷1

=42 1 0 -1 0 1

New X2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
30 𝟏 1 𝟏 0 0
𝟐 𝟐
-1(42 1 0 -1 0 1)
=9 0 1 1 0 1
-
2

New S2 = Old Row – (Pivot Column Old Row PCOR * Entering Row X1)
30 𝟏 1 𝟏 0 0
𝟐 𝟐
-1(42 1 0 -1 0 1)
= -30 -2 0 -1 1 -1
 Cj 3 4 0 0 0
Product Quantity X1 X2 S1 S2 S3
1
9 0 1 1 0 -
4 X2 2
0 S2 -30 -2 0 -1 1 -1

3 X3 42 1 0 -1 0 1

Zj 162 3 4 1 0 0
Cj-Zj 0 0 1 0 -1

Decision:
x1 = 42
x2 = 9
x3 = 0
Maximum P = 162