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
Simplex Method
problems in
maximization using
(Maximization)
simplex method.
◦ ECOMODA GARMENTS COMPANY
◦Illustrative examle:
◦ ECOMODA, a clothing line manufacturer that produces men’s shirts and pants, has two
(2) primary resources available, sewing machine time (in the sewing department) and
cutting machine time (in the 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 each pair of pants requires two
(2) hours of sewing machine time and one (1) hour of cutting machine time. If profit is
P30/shirt and P40/pant, 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 + P2y
Subject to: 1x + 2y ≤ 24
2x + 1y ≤ 30
x, y ≥ 0
◦Step 2:
Write the new linear program by adding a slack variables in
converting the constraints to equal.
To maximize: Z = P30x + P2y +0S1 +0S2
Subject to: 1x + 2y +S1 +0S2 = 24
2x + 1y +0S1 +S2 = 30
x, y, S1,S2 ≥ 0
S1 = slack variable ( unused time ) in sewing department .
S2 = slack variable ( unused time ) in 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 + P2y +0S1 +0S2Cj 30 40
0 0
Subject to: 1x + 2y +S1 +0S2 = 24 Profit PM Quantity x y
2x + 1y +0S1 +S2 = 30 S1 S2
x, y, S1,S2 ≥ 0
◦ 0
Outgoing variable
S1 24 1 2
1 0
◦ 0 S2 30 2 1
◦ 0
Steps in developing the second tableau. 1
Optimum column Zj 0 0
1. Determine optimum column (highest value in0the Cj 0
– Zj row) and the entering variable
(y). It is the variable in the optimum column.
Cj – Zj 30 40
0 0
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
Replacing row ; New entries for S0
2 row
0
PM Quantity x y
24÷ 2 = 12 30 – (1 x 12) = 18 S1 S2
1 ÷2 = ½ 2 – (1 x ½) = 1 ½
40 y 12 1/2 1
1/2 0
2÷2=1 1 – ( 1 x1) = 0 0 S2 18 1½ 0
1÷2=½ 0 0 – (1 x 1/2) =– ½ – 1/2 1
0÷2=0 1 – (1 x 0) = 1 480 20 40
20 0
+ 0 0 0
The presence of positive value (10) in the x column
0 0of the C j – Zj row of the
second tableau indicates that Zj 480 20 40
further improvement is possible. Therefore,20 the same
0 process will be used to
develop the third tableau. Cj – Zj 10 0
– 20 0
Solution from the second tableau 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
Outgoing variableS1 S2
40 y 12 1/2 1
1/2 0
0 S2 18 1½ 0
– 1/2 1
480 Optimum
20 column
40
1. Determine optimum column (highest 20 0
positive value in the Cj – Zj row)
+ in 0the optimum
and the entering variable. It is the variable 0 column.0
0 0
2. Determine the out going variable by Zj
dividing the quantity
480 20by the
40
number found in the optimum column
20 in each
0 row.
◦ Cj – Zj
For; y = 12 ÷ ½ = 24 and 10
For S2 = 18 ÷ 1 ½ = 12 0
– 20 0
◦ 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
Third Tableau: Cj 30 40
0 0
Replacing Row New Entries for Y PM
row Quantity x y
18 ÷ 1 2/2 = 12 12(–1/2)+12 =S6
1 S2
1 ½ ÷1 ½ = 1 40= 0 y
1(–1/2)+1/2 6 0 1
2/3 – 1/3
0÷1½ =0 0(–1/2)+1 = 1
30 x 12 1 0
– ½ ÷ 1 ½ =–1/3 –1/3(–1/2)+1/2 = 2/3
– 1/3 2/3
1 ÷ 1 ½ = 2/3 2/3(–1/2)+0 = –1/3 240 0 40
80/3 – 40/3
As there is no positive value in the C j –+Zj360row , no further
30 0 –
improvement is possible. The30/3 60/3
Zj 600 30 40
optimum solution has been obtained.
50/3 20/3
Decision: x = 12 shirts Cj – Zj y=
0 6 pants
0 –
50/3 –20/3

Maximum Profit = P600.00

Homework: Simplex Method (Maximization)
A chocolate manufacturing company produces 2 types of chocolate; Special and
Regular;
Both the chocolates requires milk and cocoa only. To manufacture each unit of
Special and
Ordinary the following quantities are required; Each unit of Special requires 1
unit of milk and
3 units of cocoa. Each unit of Regular requires 1 unit of milk and 2 units of
cocoa. The
company’s kitchen has a total of 5 units of milk and 12 units of cocoa available
for use. On each
sale the company make a profit of $8 per unit of Special sold and $6 per unit of
Regular sold.
Formulate the linear program and solve using simplex method.
KEEP SAFE EVERYONE
END