# FACULTY OF SCIENCE AND TECHNOLOGY

SEMESTER SEPTEMBER TAHUN 2012

EBTM 4203 OPERATIONAL MANAGEMENT

NO. MATRIKULASI NO. KAD PENGNEALAN NO. TELEFON E-MEL PUSAT PEMBELAJARAN

: : : : :

681104035475001 681104-03-5475 019-9575476 nordin_yusof@oum.edu.my PP KUALA TERENGGANU

...........................................................................................................................................................................EBTM4203 SEPTEMBER 2012 681104035475001 Table of Contents QUESTION 1 ( i ) ....................................................... 10 Page 1 of 11 .................... 2 QUESTION 1 ( ii ) ......... 7 QUESTION 2...................................................................................

Problem Statement. Page 2 of 11 . Therefore. Daily hours for finishing. Maximum hours allocated . Subject to :- . Therefore (non-negativity conditions). Daily hours for framing. .EBTM4203 SEPTEMBER 2012 681104035475001 QUESTION 1 ( i ) Variables Objective Total Expected Profit. Constant Daily hours for painting. Maximize. for painting. for finishing. for framing.

and . When.00 Page 3 of 11 . When.EBTM4203 SEPTEMBER 2012 681104035475001 For Value . a) Painting. When. and . and . When.00 c) Framing. When. and For Value . a) Painting.00 b) Finishing. and b) Finishing.

When. and Page 4 of 11 . and . and . and .00 For Value . When.00 b) Finishing.00 c) Framing.EBTM4203 SEPTEMBER 2012 681104035475001 c) Framing. When. a) Painting. When.

EBTM4203 SEPTEMBER 2012 681104035475001 The optimum solution Equation 1 . Multiply ”Equation 1” by 3 and ”Equation 2” by -2 for eliminate X1 Page 5 of 11 . Equation 4 . Equation 2 . Multiply ”Equation 3” by -2 for eliminate X1 using equation 2 and equation 3 Therefore. Equation 3 .

the optimal solution is for producing of each paintings type to obtain the maximum profit is:- Page 6 of 11 . substitute and into equation 1 to find . substitute into equation 4 to find . Now.EBTM4203 SEPTEMBER 2012 681104035475001 Therefore. Therefore. Now.

Problem Statement. Page 7 of 11 . Subject to :- By introducing slack variables Maximize. Maximize. Subject to :- Using the basic feasible solution: .EBTM4203 SEPTEMBER 2012 681104035475001 QUESTION 1 ( ii ) To determine the optimal step-by-step solution in simplex method.

6 Page 8 of 11 . New Pivot Row = Curent Pivot Row / Pivot No.EBTM4203 SEPTEMBER 2012 681104035475001 Iteration 0 . (0) (1) 116 4. (0) (1) (2) (3) Solution Ratio Iteration Basic Variable Eq.4 0 Solution 1 (2) (3) 0. = Minimum Ratio = 16 Basic Variable Coefficient of Eq. (0) (1) Coefficient of Solution 0 (2) (3) Pivot column = Iteration Basic Variable Coefficient of Eq.

(0) (1) 580 0 Coefficient of Solution 0.3 3 (2) (3) 0 MAXIMIZED PROFIT = 4079 This solution is optimal because none of the coefficients in row ”Eq(0)” is negative. Page 9 of 11 .EBTM4203 SEPTEMBER 2012 681104035475001 New Pivot column = Iteration Basic Variable Coefficient of Eq. (0) (1) 860 2 0 Solution 2 (2) (3) New Pivot column = 0 Iteration Basic Variable Eq.

Create a dummy Construction Site Plant 1 2 3 Demands ( tons ) 130 130 Construction Site B C 12 10 120 20 100 120 5 4 9 8 Supply (tons ) 180 150 170 500 A 9 6 7 Dummy 0 60 0 0 70 190 60 2) Evaluate the unoccupied cells using 170 System of equations: R1 + K3 = 10 R1 + K4 = 0 R2 + K1 = 6 R2 + K2 = 5 R3 + K2 = 4 R3 + K3 = 8 Setting R1 = 0 K3 = 10 – 0 = 10 K4 = 0 – 0 = 0 K1 = 6 – (–1) = 7 R2 = 5 – 6 = –1 K2 = 4 – (–2) = 6 R3 = 8 – 10 = –2 K1=7 K2=6 K3=10 K4=0 Plant R1= 0 R2= -1 R3= -2 A 9 6 7 1 2 3 Demands ( tons ) 130 130 Construction Site B C 12 10 120 20 100 120 5 4 9 8 Dummy 0 60 0 0 Supply (tons ) 180 150 170 500 70 190 60 Page 10 of 11 .EBTM4203 SEPTEMBER 2012 681104035475001 QUESTION 2 1) Unbalanced problem .

Route From (Plant) 1 1 2 2 3 3 Units Supply Cost per unit To (tons) (RM) (Construction Site) C 120 10 Dummy 60 0 A 130 6 B 20 5 B 100 4 C 70 8 Total minimised transportation cost Total Cost (RM) 1. Unoccupied Cell 1A 1B 2C 2Dummy 3A 3Dummy Improvement Index (lij = cij – R – K) 9 – 0 – 7 = +2 12 – 0 – 6 = +6 9 – (–1) – 10 = 0 0 – (–1) – 0 = +1 7 – (–2) – 7 = +2 0 – (–2) – 0 = +2 All of improvement index are nonnegative and therefore this solution is optimal.040.200 0 780 100 400 560 3.040 TOTAL MINIMISED TRANSPORTATION COST IS RM3. 4) Total minimized the transportation cost.00 Page 11 of 11 .EBTM4203 SEPTEMBER 2012 681104035475001 3) Improvement indices for all the unoccupied cells.

Sign up to vote on this title