MAXIMI

ZATION ≤/
≥
Cj

Zj

PROBL S1

EM
S2
 Jenny Furniture Shop produces two types of tables: an elegant table and
an ordinary table. A table, whether elegant or ordinary, passes through two
departments, namely, the assembly department and finishing department.
Each elegant table requires 8 hours in the assembly department and 2 hours
in finishing tasks. Each ordinary table requires 6 hours in the assembly
department and 2 hours in the finishing department. Every production
period, the assembly department has 480 hours available, while the finishing
department has 200 hours available. An elegant table contributes ₱700.00 to
the company’s profit, while an ordinary table has profit of ₱500.00.

Required: Using the simplex method of linear programming, determine the number of
units needed to be produced to maximize profits.
 OBSERVE
ASK YOURSELF: What is the situation all
about?
Determine the number of units needed to be produced to
maximize profit.

Define the problem

What are the constraints?
The availability of working hours in the assembly department
and finishing department.

What do we want to achieve?

The number of units to be produced to maximize profits.
 Step 1
Jenny Furniture Shop produces two types of tables: an elegant table and an ordinary table. A table,
whether elegant or ordinary, passes through two departments, namely, the assembly department and
finishing department. Each elegant table requires 8 hours in the assembly department and 4 hours of
finishing tasks. Each ordinary table requires 6 hours in the assembly department and 2 hours in the
finishing department. Every production period, the assembly department has 480 hours available, while
the finishing department has 200 hours available. An elegant table contributes ₱700.00 to the company’s
profit, while an ordinary table has profit of ₱500.00.

Set up the objective function and the constraints of the problem.

Let x = number of elegant tables
y = number of ordinary tables
Objective
Max Profit: P = ₱700x + ₱500y Function
 Step 1
Jenny Furniture Shop produces two types of tables: an elegant table and an ordinary table. A table,
whether elegant or ordinary, passes through two departments, namely, the assembly department and
finishing department. Each elegant table requires 8 hours in the assembly department and 4 hours of
finishing tasks. Each ordinary table requires 6 hours in the assembly department and 2 hours in the
finishing department. Every production period, the assembly department has 480 hours available, while
the finishing department has 200 hours available. An elegant table contributes ₱700.00 to the company’s
profit, while an ordinary table has profit of ₱500.00.

Set up the objective function and the constraints of the problem.

Let x = number of elegant tables
y = number of ordinary tables
Max Profit: P = ₱700x + ₱500y
Subject to: 8x + 6y
 Step 1
Jenny Furniture Shop produces two types of tables: an elegant table and an ordinary table. A table,
whether elegant or ordinary, passes through two departments, namely, the assembly department and
finishing department. Each elegant table requires 8 hours in the assembly department and 4 hours of
finishing tasks. Each ordinary table requires 6 hours in the assembly department and 2 hours in the
finishing department. Every production period, the assembly department has 480 hours available, while
the finishing department has 200 hours available. An elegant table contributes ₱700.00 to the company’s
profit, while an ordinary table has profit of ₱500.00.

Set up the objective function and the constraints of the problem.

Let x = number of elegant tables
y = number of ordinary tables
Max Profit: P = ₱700x + ₱500y
Subject to: 8x + 6y
4x + 2y
 Step 1
Jenny Furniture Shop produces two types of tables: an elegant table and an ordinary table. A table,
whether elegant or ordinary, passes through two departments, namely, the assembly department and
finishing department. Each elegant table requires 8 hours in the assembly department and 4 hours of
finishing tasks. Each ordinary table requires 6 hours in the assembly department and 2 hours in the
finishing department. Every production period, the assembly department has 480 hours available, while
the finishing department has 200 hours available. An elegant table contributes ₱700.00 to the company’s
profit, while an ordinary table has profit of ₱500.00.

Set up the objective function and the constraints of the problem.

Let x = number of elegant tables
y = number of ordinary tables
Max Profit: P = ₱700x + ₱500y
Subject to: 8x + 6y
4x + 2y Non-negativity
x, y constraint
 Step 2
Convert the explicit constraints to equations. The procedure of conversion used
for the maximization of profits shall be observed. After the conversion, the
objective function shall be improved.

Max Profit: ₱700x + ₱500y

NOTE Subject to: 8x + 6y ≤ 480
1. Add a slack variable if the 4x + 2y ≤ 200
symbol used is ≤.
2. Add a slack variable if the
symbol used is =.
3. Multiply the equation by
negative 1 and add a slack
variable if the symbol sign is Subject to: 8x + 6y + S1 = 480
≥.
 Step 2
Convert the explicit constraints to equations. The procedure of conversion used
for the maximization of profits shall be observed. After the conversion, the
objective function shall be improved.

Max Profit: ₱700x + ₱500y

NOTE Subject to: 8x + 6y ≤ 480
1. Add a slack variable if the 4x + 2y ≤ 200
symbol used is ≤.
2. Add a slack variable if the
symbol used is =.
3. Multiply the equation by
negative 1 and add a slack
variable if the symbol sign is Subject to: 8x + 6y + S1 = 480
≥.
4x + 2y + S2 = 200
 Step 2
Convert the explicit constraints to equations. The procedure of conversion used
for the maximization of profits shall be observed. After the conversion, the
objective function shall be improved.

Max Profit: ₱700x + ₱500y

NOTE Subject to: 8x + 6y ≤ 480
1. Add a slack variable if the 4x + 2y ≤ 200
symbol used is ≤.
2. Add a slack variable if the
symbol used is =.
3. Multiply the equation by
negative 1 and add a slack Max Profit: ₱700x + ₱500y + 0S1 + 0S2
variable if the symbol sign is Subject to: 8x + 6y + S1 = 480
≥.
4x + 2y + S2 = 200
 Step 3
Prepare the simplex tableau and compute for the values of Cj, Zj, and Cj – Zj. Only
positive constraint coefficients must be input in the initial table. In the problem, all
constraint coefficients (S1 and S2) have positive values. The simplex tableau appears as
follows:
Max Profit: ₱700x + ₱500y + 0S1 + 0S2

Table 1. Initial Table

Cj 700 500 0 0
Product Solution quantity x y S1 S2
 Step 3
Prepare the simplex tableau and compute for the values of Cj, Zj, and Cj – Zj. Only
positive constraint coefficients must be input in the initial table. In the problem, all
constraint coefficients (S1 and S2) have positive values. The simplex tableau appears as
follows:
Max Profit: ₱700x + ₱500y + 0S1 + 0S2
Subject to: 8x + 6y + S1 = 480

Table 1. Initial Table

Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
 Step 3
Prepare the simplex tableau and compute for the values of Cj, Zj, and Cj – Zj. Only
positive constraint coefficients must be input in the initial table. In the problem, all
constraint coefficients (S1 and S2) have positive values. The simplex tableau appears as
follows:
Max Profit: ₱700x + ₱500y + 0S1 + 0S2
Subject to: 8x + 6y + S1 = 480
4x + 2y + S2 = 200
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1

The value of Zj is computed as follows:

S1 0 (480 8 6 1 0) =
+
S2 0 (200 4 2 0 1) =
Zj =
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1

The value of Zj is computed as follows:

S1 0 (480 8 6 1 0) =
+
S2 0 (200 4 2 0 1) =
Zj =
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1

The value of Zj is computed as follows:

S1 0 (480 8 6 1 0) = 0 0 0 0 0
+
S2 0 (200 4 2 0 1) =
Zj =
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1

The value of Zj is computed as follows:

S1 0 (480 8 6 1 0) = 0 0 0 0 0
+
S2 0 (200 4 2 0 1) = 0 0 0 0 0
Zj =
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1

The value of Zj is computed as follows:

S1 0 (480 8 6 1 0) = 0 0 0 0 0
+
S2 0 (200 4 2 0 1) = 0 0 0 0 0
Zj = 0 0 0 0 0
 Step 3
S1 0 (480 8 6 1 0) = 0 0 0 0 0
S2 0 (200 4 2 0 1) = 0 0 0 0 0
Zj = 0 0 0 0 0

Table 1. Initial Table

Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
The value of Cj – Zj is computed as follows:

Cj 700 500 0 0
-
Zj 0 0 0 0
Cj – Z j
 Step 3
Table 1. Initial Table
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
The value of Cj – Zj is computed as follows:

Cj 700 500 0 0
-
Zj 0 0 0 0
Cj – Z j 700 500 0 0
 Step 3
Cj 700 500 0 0
-
Zj 0 0 0 0
Cj – Z j 700 500 0 0

Table 1. Initial Table

Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
Cj – Z j 700 500 0 0
 Step 4
Check if the simplex tableau needs to be improved. In a maximization problem, the table
needs to be improved if there is a positive value in the C j – Zj row. However, once the Cj –
Zj values are already equal to zero or negative, an optimal solution has been reached already.
In table 1, there are positive value in the C j – Zj row; hence, the table needs improvement.

Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
C j – Zj 700 500 0 0

Positive Value
 Step 5
To improve the table, determine the incoming column and outgoing row. In a
maximization problem, the incoming column, or the so-called optimum column
is the column that has the highest positive value in the C j – Zj row.
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S11 480 8 6 1 0
0
0 S
S22 200
200 44 22 00 1
1
Z
Zjj 00 00 00 00 0
0
C
Cjj –
–Z Zjj 700
700 500
500 00 0
0
Incoming
Incoming Variable
Column
 Step 5
After determining the incoming column, the outgoing row shall then be determined by
dividing the values in the quantity column with the pivot value of the incoming column.
The pivot value is the intersectional element of the incoming column and the
corresponding row. The variable with the lowest value is the outgoing variable. The
determination of the outgoing variable appears as follows:
Product Solution Quantity Pivot Value Quotient
S1 480 ÷ 8 = 60
S2 200 ÷ 4 = 50
Cj 700 500 0 0
Product Solution quantity x y S11 S22
00 S11
S 480
480 8
8 6
6 11 00
00 S 200 4 2 00 11 Outgoing
S22 200 4 2 Variable
Z
Zjj 0
0 0
0 0
0 00 00
C j – Zj 700 500 0 0
C j – Zj 700 500 0 0
Incoming
Column
 Step 5
S2 has the lowest value; thus, it is the outgoing variable that is replaced by variable x as
the incoming variable.
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0 Outgoing
Variable
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
C j – Zj 700 500 0 0
Incoming
Variable

Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x
0 S1
Zj
C j – Zj
 Step 6
Improve the table and repeat step 3. The table before improvement appears as
follows:
Table 2. Table Before Improvement
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x
0 S1
Zj
Cj – Zj
When the table is improved, there will be new values for the variables. The new values
of the incoming variable x that will replace S2 are determined as follows:
Old Values of Outgoing Pivot Value of Incoming Values of Incoming
Variable (S2) Variable (x) Variable
200 ÷ 4 = 50
4 ÷ 4 = 1
2 ÷ 4 = 1/2
0 ÷ 4 = 0
1 ÷ 4 = 1/4
 Step 6
Old Values of Outgoing Pivot Value of Incoming Values of Incoming
Variable (S2) Variable (x) Variable
200 ÷ 4 = 50
4 ÷ 4 = 1
2 ÷ 4 = 1/2
0 ÷ 4 = 0
1 ÷ 4 = 1/4

Table 3. After Computing for the Values of the Incoming Variable x

Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1
Zj
C j – Zj
 Step 6
When the given values in the problem are not expressed in decimals, the computed
values for the incoming variable should be expressed in fractions to facilitate the
computation. The new values of S1 are determined as follows:
Old Values of Retained Pivot Value of Retained New Values of New Values of Retained
Variable (S1) Variable (S1) Incoming Variable (x) Variable (S1)
480
480 -- 88 xx 50
50 =
= 80
80
88 -- 88 xx 11 =
= 00
66 -- 88 xx 1/2
1/2 =
= 22
11 -- 88 xx 00 =
= 11
00 -- 88 xx 1/4
1/4 =
= -2
-2
Table 4. After Computing for the New Values of S1
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj
Cj – Zj
 Step 6
Table 4. After Computing for the New Values of S1
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj
Cj – Zj

x 700 (50 1 1/2 0 1/4) = 35,000 700 350 0 175

+
S1 0 (80 0 2 1 -2) =
Zj =
 Step 6
Table 4. After Computing for the New Values of S1
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj
Cj – Zj

x 700 (50 1 1/2 0 1/4) = 35,000 700 350 0 175

+
S1 0 (80 0 2 1 -2) = 0 0 0 0 0
Zj = 35,000 700 350 0 175
 Step 6
Table 4. After Computing for the New Values of S1
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj 35,000 700 350 0 175
Cj – Zj

x 700 (50 1 1/2 0 1/4) = 35,000 700 350 0 175

+
S1 0 (80 0 2 1 -2) = 0 0 0 0 0
Zj = 35,000 700 350 0 175
 Step 6
Table 4. After Computing for the New Values of S1
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj 35,000 700 350 0 175
Cj – Zj 0 150 0 -175

x 700 (50 1 1/2 0 1/4) = 35,000 700 350 0 175

+
S1 0 (80 0 2 1 -2) = 0 0 0 0 0
Zj = 35,000 700 350 0 175
Cj 700 500 0 0
-
Zj 700 350 0 175
C j – Zj 0 150 0 -175
 Step 6
Table 4. After Computing for the New Values of S1
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj 35,000 700 350 0 175
C j – Zj 0 150 0 -175

In Table 4, the Cj – Zj row has a non-negative value of 150. Hence, the optimal
solution has not reached yet. The table still needs improvement.
 Step 7
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj 35,000 700 350 0 175
C j – Zj 0 150 0 -175
Incoming
Variable
To improve the table, repeat step 3. The incoming variable is y, as it has the non-negative
value. The outgoing variable is determined as follows:

Product Solution Quantity Pivot Value Quotient

x 50 ÷ 1/2 = 100
S11 80 ÷ 2 = 40 Outgoing
Variable

The outgoing variable, therefore is S 1 because it has the lowest value.

 Step 7
Cj 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj 35,000 700 350 0 175
C j – Zj 0 150 0 -175
Incoming
Variable

Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y
700 x
Zj
Cj – Z j
 Step 7
Table 5. Before Improvement for the Second Iteration
Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y
700 x
Zj
C j – Zj
The new values of the incoming variable y, which will replace S 1 are determined first as
follows:
Old Values of Outgoing Pivot Value of Incoming Values of Incoming
Variable (S1) Variable (y) Variable
80 ÷ 2 = 40
0 ÷ 2 = 0
2 ÷ 2 = 1
1 ÷ 2 = 1/2
-2 ÷ 2 = -1
 Step 7
Old Values of Outgoing Pivot Value of Values of Incoming
Variable (S1) Incoming Variable (y) Variable
80
80 ÷
÷ 22 =
= 40
40
00 ÷
÷ 22 =
= 00
22 ÷
÷ 22 =
= 11
1 ÷ 2 = 1/2
1 ÷ 2 = 1/2
-2 ÷ 2 = -1
-2 ÷ 2 = -1

Table 6. After Computing for the Values of Variable y

Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x
Zj
C j – Zj
 Step 7
Table 6. After Computing for the Values of Variable y
Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x
Zj
C j – Zj

Old Values of Retained Pivot Value of Retained New Values of New Values of Retained
Variable (x) Variable (x) Incoming Variable (y) Variable (x)
50 - 1/2 x 40 = 30
1 - 1/2 x 0 = 1
1/2 - 1/2 x 1 = 0
0 - 1/2 x 1/2 = -1/4
1/4 - 1/2 x -1 = 3/4
 Step 7
Old Values of Retained Pivot Value of New Values of New Values of Retained
Variable (x) Retained Variable (x) Incoming Variable (y) Variable (x)
50
50 -- 1/2
1/2 xx 40
40 =
= 30
30
11 -- 1/2
1/2 xx 00 =
= 11
1/2
1/2 -- 1/2
1/2 xx 11 =
= 00
0 - 1/2 x 1/2 = -1/4
0 - 1/2 x 1/2 = -1/4
1/4 - 1/2 x -1 = 3/4
1/4 - 1/2 x -1 = 3/4

Table 7. After Computing for the Values of Variable x

Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x 30 1 0 -1/4 3/4
Zj
C j – Zj
 Step 7
Table 7. After Computing for the Values of Variable x
Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x 30 1 0 -1/4 3/4
Zj
C j – Zj

y 500 (40 0 1 1/2 -1) =

+
x 700 (30 1 0 -1/4 3/4) =
Zj =
 Step 7
Table 7. After Computing for the Values of Variable x
Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x 30 1 0 -1/4 3/4
Zj 41,000 700 500 75 25
C j – Zj

y 500 (40 0 1 1/2 -1) = 20,000 0 500 250 -500

+ x 700 (30 1 0 -1/4 3/4) = 21,000 700 0 -175 525
Zj = 41,000 700 500 75 25
 Step 7
Table 7. After Computing for the Values of Variable x
Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x 30 1 0 -1/4 3/4
Zj 41,000 700 500 75 25
C j – Zj 0 0 -75 -25

y 500 (40 0 1 1/2 -1) = 20,000 0 500 250 -500

+
x 700 (30 1 0 -1/4 3/4) = 21,000 700 0 -175 525
Zj = 41,000 700 500 75 25

Cj 700 500 0 0
-
Zj 700 500 75 25
Cjj –– Z
C Zjj 00 00 -75
-75 -25
-25
 Step 7
Table 7. After Computing for the Values of Variable x
Cj 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x 30 1 0 -1/4 3/4
Zj 41,000 700 500 75 25
C j – Zj 0 0 -75 -25
This time, Cj – Zj row does not have positive values anymore. This
indicates that the optimal solution has been reached already. The
recommendation is to produce 40 of product y and 30 units of product x to
realize a profit of ₱41,000. This result is the same with the graphical approach
discussed in Chapter 2.
SUMMAR
Y
In summary, only the following
simplex tableaus are needed to
determine the optimal solution:
 01
Initial Table
.
Cj 700 500 0 0
Product Solution quantity x y S1 S2
0 S1 480 8 6 1 0
0 S2 200 4 2 0 1
Zj 0 0 0 0 0
Cj – Zj 700 500 0 0
 02
FIRST
.
Cj ITERATION 700 500 0 0
Product Solution quantity x y S1 S2
700 x 50 1 1/2 0 1/4
0 S1 80 0 2 1 -2
Zj 35,000 700 350 0 175
Cj – Zj 0 150 0 -175
 03
second
.
Cj ITERATION 700 500 0 0
Product Solution quantity x y S1 S2
500 y 40 0 1 1/2 -1
700 x 30 1 0 -1/4 3/4
Zj 41,000 700 500 75 25
Cj – Zj 0 0 -75 -25
THANK YOU!