MODULE

7 ◦ Management Science
MODULE G ALS FLEX Course Material

Linear Programming Simplex

Maximization

College of Business and Accountancy

LESSON
#7
LEARNING
OUTC MES
Linear Programming
Solve linear program problems
in simplex maximization. Simplex Method
Construct a simplex table with
accuracy and precision. (Maximization)
Evaluate the optimality of a
simplex maximization table.
◦ ECOMODA GARMENTS COMPANY
◦ Illustrative examle:

◦ ECOMODA, a clothing line manufacturer produces men’s shirts and pants. The company has two (2) primary
resources available; sewing machine time (sewing department) and cutting machine time (cutting department).
Over the next week. Ecomoda can schedule up to 24 hours of work in the sewing department and 30 hours of
work in the cutting department. Each shirt produced requires one (1) hour of sewing machine time and two (2)
hours of cutting machine time. Producing a pair of pants requires two (2) hours of sewing machine time and one
(1) hour of cutting machine time. The profit contribution for each shirt is P30, and P40 for a pair of pants.
Determine the best possible combination of shirts and pants to produce and sell in order to realize the maximum
profit.
◦ Given:
◦ Manufacturing Problem Information:

Hours required for

Departments 1 unit of product Total hours available
Shirt (x) Pants (y)
Sewing Dept. 1 2 24
Cutting Dept. 2 1 30
Profit per Unit P30 P40

◦ Step1:
Formulate the linear program model
To maximize: Z = P30x + P40y
Subject to: 1x + 2y ≤ 24
2x + 1y ≤ 30
x ≥ 0, y ≥ 0
◦ Step 2:
Write the new linear program by adding a slack variables in converting the constraints to equal.
To maximize: Z = P30x + P40y +0S1 +0S2
Subject to: 1x + 2y +S1 +0S2 = 24
2x + 1y +0S1 +S2 = 30
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0
S1 = slack variable (represent the unused time ) in the sewing department .
S2 = slack variable ( represent the unused time ) in the cutting department .
◦ Step 3:
Enter the numerical coefficients of the equation in the simplex tableau and identify the parts and
function of each.
Initial simplex tableau Product Mix Entering variable

To maximize: Z = P30x + P40y +0S1 +0S2 Cj 30 40 0 0

PM Quantity x y S1
Subject to: 1x + 2y +S1 +0S2 = 24 Profit
S2
2x + 1y +0S1 +S2 = 30
0 S1 24 1 2 1 0
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0
0 S2 30 2 1 0 1
◦ Outgoing variable
Zj 0 0 0 0
◦ Cj – Zj 30 40 0 0
◦ Steps in developing the second tableau. Optimum column

1. Determine optimum column (highest value in the Cj – Zj row) and the entering variable (y). It is the variable in the optimum
column.
2. Determine the out going variable by dividing the quantity by the number found in the optimum column in
each row. For; S1 = 24 ÷ 2 = 12 and For S2 = 30 ÷ 1 = 30
◦ The smaller quotient belongs to outgoing variable (S1) .
3. Develop the replaced row (entries of the entering variable). Divide each entry in the replacement
row by the intersection element (2) of the replaced row.
New entries in the
Replacing row ;
◦ 24÷ 2 = 12
◦ 1 ÷2 = ½
◦ 2÷2=1
◦ 1÷2=½
◦ 0÷2=0
4. Compute The new values for the remaining rows using the formula.
◦ New entry = Elements in the old row – [ interesectional element in old row) x
◦ (Corresponding elements in the replacing row ]
Elements in Old row – Intersection e in Old Row x Replacing Row

◦ ( 30, 2, 1, 0, 1) – [ (1) x (12, ½, 1, ½, 0) ]

New elements for S2 row
◦ 30 – (1 x 12) = 18
2 – (1 x ½) = 1 ½
◦ 1 – ( 1 x1) = 0
◦ 0 – (1 x 1/2) =– ½
◦ 1 – (1 x 0) = 1
5. Enter the new entries of the replacing row and the new entries for S2 row in the second tableau.
Second Tableau Cj 30 40 0 0
PM Quantity x y S1 S2
Replacing row ; New entries for S2 row 40 y 12 1/2 1 1/2 0
0 S2 18 1½ 0 – 1/2 1
24÷ 2 = 12 30 – (1 x 12) = 18
480 20 40 20 0
1 ÷2 = ½ 2 – (1 x ½) = 1 ½ + 0 0 0 0 0
2÷2=1 1 – ( 1 x1) = 0 Zj 480 20 40 20 0
Cj – Zj 10 0 – 20 0
1÷2=½ 0 0 – (1 x 1/2) =– ½
0÷2=0 1 – (1 x 0) = 1
The presence of positive value (10) in the x column of the Cj – Zj row of the second tableau indicates
that further improvement is possible. Therefore, the same process will be used to develop the third
tableau. Solution from the secondtableau must be repeated in order to determine the new entries for
the third tableau.
Calculating for Zj
◦ Quantity Column: 40(12) + 0(18) = 480
◦ X column : 40(1/2 ) + 0(1 ½ ) = 20
◦ Y column: 40(1) + 0( 0 ) = 40
◦ S1 column : 40(1/2 ) + 0(1 ½ ) = 20
◦ S2 column: 40(0 ) + 0(0) = 0
Calculating Cj - Zj
◦ 30 – 20 = 10
◦ 40 – 40 = 0
◦ 0 – 20 = – 20
◦ 0– 0 =0
Steps in developing the third table: Entering variable

Cj 30 40 0 0
PM Quantity x y S1 S2
Outgoing variable
40 y 12 1/2 1 1/2 0
0 S2 18 1½ 0 – 1/2 1
480 20 40 20 0
+ 0 0 0 0 0
Zj 480 20 40 20 0
Cj – Zj 10 0 – 20 0

Optimum column
1. Determine optimum column (highest positive value in the Cj – Zj row) and the entering variable. It is the
variable in the optimum column.
2. Determine the out going variable by dividing the quantity by the number found in the optimum
column in each row.
◦ For; y = 12 ÷ ½ = 24 and For S2 = 18 ÷ 1 ½ = 12
◦ The smaller quotient belongs to outgoing variable (S2) .
3.Develop the replaced row (elements of the entering variable). Divide each member in the
replacement row by the intersection element (2) of the replaced row.
New entries in the Replacing row (S2)
◦ 18 ÷ 1 2/2 = 12
◦ 1 ½ ÷1 ½ = 1
◦ 0÷1½ =0
◦ – ½ ÷ 1 ½ = –1/3
◦ 1 ÷ 1 ½ = 2/3
4. Compute The new values for the remaining rows using the formula.
◦ New entry = Old row Old Row –(Intesection element of the old row x Replacing Row)
◦ Old Row – (–1/2 x Replacing Row)
New Entry = ( 12, ½, 1, ½, 0) – [ (1/2) x (12, 1, 0, –1/3, 2/3) ]
New entries for y row
◦ 12 – (1/2 x 12) = 6
◦ ½ – (1/2 x 1) = 0
◦ 1 – (1/2 x 0) = 1
◦ ½ – (1/2 x (– 1/3) = 2/3
◦ 0 – (1/2 x 2/3 = –1/3
5. Enter the new entries of the replacing row and the new entries of y row in the third simplex
tableau.
Third Tableau: Cj 30 40 0 0
PM Quantity x y S1 S2
Replacing Row New Entries for Y row 40 y 6 0 1 2/3 – 1/3
18 ÷ 1 2/2 = 12 12(–1/2)+12 = 6 30 x 12 1 0 – 1/3 2/3

1 ½ ÷1 ½ = 1 1(–1/2)+1/2 = 0 240 0 40 80/3 – 40/3

+ 360 30 0 – 30/3 60/3
0÷1½ =0 0(–1/2)+1 = 1 Zj 600 30 40 50/3 20/3
Cj – Zj 0 0 –50/3 –20/3
– ½ ÷ 1 ½ =–1/3 –1/3(–1/2)+1/2 = 2/3
1 ÷ 1 ½ = 2/3 2/3(–1/2)+0 = –1/3

As there is no positive value in the Cj – Zj row , no further improvement is possible. The

optimum solution has been obtained.
Decision: x = 12 shirts y = 6 pants

Maximum Profit = P600.00

◦ Illustrative example 2:
◦ To maximize: Z = 50x + 20y
◦ Subject to: x ≤ 20
◦ y ≤ 30
◦ x + y ≥ 48 – 1(x + y ≥ 48) –1 – x – y ≤ – 48
◦ x ≥ 0, y ≥ 0
Write the new linear program by adding a slack variables in converting the constraints to equal.
◦ To maximize: Z = 50x + 20y + 0S1+ 0S2 + 0S3
◦ Subject to: x + S1+ 0S2 + 0S3 = 20
◦ y + 0S1+ S2 + 0S3 = 30
◦ – x – y + 0S1+ 0S2 + S3 = – 48
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0, S3 ≥ 0
Solution: Product Mix Entering variable

◦ To maximize: Z = 50x + 20y + 0S1+ 0S2 + 0S3

◦ Subject to: x + S1+ 0S2 + 0S3 = 20 Cj 50 20 0 0 0
PM Quantity x y S1 S2 S3
◦ y + 0S1+ S2 + 0S3 = 30
◦ – x – y + 0S1+ 0S2 + S3 = – 48 0 S1 20 1 0 1 0 0
0 S2 30 0 1 0 1 0
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0, S3 ≥ 0 0 S3 – 48 –1 –1 1 0 1
Zj 0 0 0 0 0
Cj – Zj 50 20 0 0 0

Optimum column
Initial table:
◦ To maximize: Z = 50x + 20y + 0S1+ 0S2 + 0S3
◦ Subject to: x + S1+ 0S2 + 0S3 = 20
◦ y + 0S1+ S2 + 0S3 = 30
◦ – x – y + 0S1+ 0S2 + S3 = – 48 Product Mix Entering variable
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0, S3 ≥ 0 Cj 50 20 0 0 0
PM Quantity x y S1 S2 S3

0 S1 20 1 0 1 0 0
Pivotal row 0 S2 30 0 1 0 1 0
0 S3 – 48 –1 –1 1 0 1
Zj 0 0 0 0 0
Cj – Zj 50 20 0 0 0

Optimum column
Table II:
◦ To maximize: Z = 50x + 20y + 0S1+ 0S2 + 0S3
◦ Subject to: x + S1+ 0S2 + 0S3 = 20
◦ y + 0S1+ S2 + 0S3 = 30
◦ – x – y + 0S1+ 0S2 + S3 = – 48 Product Mix Entering variable
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0, S3 ≥ 0 Cj 50 20 0 0 0
PM Quantity x y S1 S2 S3

50 X 20 1 0 1 0 0
Pivotal row 0 S2 30 0 1 0 1 0
0 S3 – 28 0 –1 1 0 1
Zj 1,000 50 0 50 0 0
Cj – Zj 0 20 –50 0 0

Optimum column
Table III:
◦ To maximize: Z = 50x + 20y + 0S1+ 0S2 + 0S3
◦ Subject to: x + S1+ 0S2 + 0S3 = 20
◦ y + 0S1+ S2 + 0S3 = 30
◦ – x – y + 0S1+ 0S2 + S3 = – 48 Product Mix Entering variable
x ≥ 0, y ≥ 0, S1 ≥ 0,S2 ≥ 0, S3 ≥ 0
Cj 50 20 0 0 0
PM Quantity x y S1 S2 S3

Pivotal row 50 X 20 1 0 1 0 0
20 Y 30 0 1 0 1 0
Decision:
0 S3 2 0 0 1 1 1
x = 20 units
Zj 1,000 50 0 50 0 0
y = 30 units 600 0 20 0 20 0
Maximum Profit = P1,600 0 0 0 0 0
50 20 50 20 0
Cj – Zj 0 0 –50 – 20 0
KEEP SAFE EVERYONE
END