Printed Pages ~ 13 576311 (76) MBA (3° Semestor) Examination, Nov-Dec., 2013 Branch : Management ‘OPTIMIZATION METHODS (NEW) Time Allowed : Three Hours ‘Maximum Marks : 80 (Minimum Pass Marks : 24 [Note : Part (a) of each unit i compulsory. Attempt any two from parts (b), (c) and (6). Q. 4. (@) What do you mean by feasible soluton of linear programming problem 7 2 576311 (76) pro.2 (b) A manufacturer produces two types. of models M1 and M2. Each model of Mt requires 4 hours of grinding and 2 hours of polishing, whereas each model of the type (Ma requires 2 hours of arinding and 5 hours of pokshing, The manufacturers have 2 ‘grinders and 3 polishers. Each grinder works, 40 hours a’week and each polisher works 60 hours @ week. Profit on Mit model is RS. 3 ‘and on M2 model is Rs. 4, Whatever is produced in @ week Is sold in the market 576311 (76) © @ How should the manufacturer allocate his production capacty to the wo types of models, so that he may make the maximum profit in a week? Soe this problem using graphical method. 7 Solve the following Linear Pro Problem wit the help of graphical method: 7 0x, + 100x,, Subject to +t $720, 5x, 4% 5 1800; Bx, + 800, ym20 576311 (76) PTO.«@ (@) Solve the following LPP using Simplex ‘method 7 Maximize Z = 3x + 2xq, Subject to 4x, + | Bry $12; 4K, + Hy = Bi hy — SB X20 1@. 2. (a) Describe the transportation problem and give its mathematical model 3 (©) Determine an initial basic feasible solution to the following transportation problem using North-West Comer Rule 1 576314 (76) ©) bi] 02 | 03] 04 | Supp a fel4{i{s] oa js 2[7| 6 o |«}sfs|2| 5 demand | 6 | 10 15|.4 | 35 ©) Solve the folowing transportation problem ‘and find out the inl basic feaibie solution sing VAM 7 pr [o2 [03 [os [su 11 | 13 [a7 | 14 | 250 16 [40 | 14 | 10 | 200 a1 | 24 | 13 | 10 | 400 [Demand 200 | 225 [275 | 250 | 950 (@) Solve the folowing transportation problem land find out the opimum solution using 576311 (76) PTO.