ABES IT Group of Institutions MBA-024: OPERATIONS RESEARCH MBA Semester II MODEL PAPER II 2012 Max. Marks: 100 Max.

Note: This paper contains 3 sections. All sections are compulsory. Section-A Write short notes on the following: a) EOL and EMV. b) Simplex algorithm. c) Graphical method of solving LP. d) Sequencing problem. e) M/M/1 queue model. f) Replacement of assets which fail suddenly. g) General form of a linear programming problem. h) Limitations of operations research. i) Principle of dominance. j) Constraints. Section-B Note: Answer any 3 questions. (10 marks x 3= 30 marks) (2 marks x 10= 20 marks) Time: 3 hours

Q1. Five persons are available to do five different jobs. From past records, the time that each person takes to do each job is known and is given in the following table: Job J1 J5 P1 P2 Person P3 P4 P5 2 6 4 4 5 9 8 6 2 3 2 7 5 7 9 7 6 3 3 5 2 1 1 1 1 J2 J3 J4

Find the assignment of persons to jobs that will minimize the total time taken.

Q2. Describe the origin and development of Operations Research (OR). Discuss the early Indian scene. Also highlight, how you use OR in day-to-day decision - making process.

Q3.Solve the following LPP. Maximize z = 30x1 + 40x2 Subject to: 60x1 + 120x2 12,000 8x1+5x2 600 3x1+4x2 500 x1, x2 0 Q4. Solve the following transportation problem by North West corner method and find the optimality of the solution. The unit costs of shipment are given in the cells below: To D From A B C Demand 5 8 11 100 4 6 7 200 12 10 11 200 200 100 200 500 E F Supply

Q5. Consider the following project. Draw the network diagram and find the project duration and identify the critical path: Job A B C D E F G H I Predecessor ----A,B A,B B D,E C,F D,E G,H Section-C Note: All questions are compulsory: (10 marks x 5 = 50 marks) Time in days 15 10 10 10 5 5 20 10 15

1. Using the concept of dominance, reduce the following 3 x 3 matrix to a two player zero sum matrix game, and solve for the optimal strategies of the players and value of the game.

Player II 1 -2 3 -2 -3 1 4 3 2 OR 1. At a certain petrol pump, customers arrive according to a Poisson Process with an average time of 5 minutes between arrivals. The service time is exponentially distributed with mean time = 2 minutes. On the basis of this information, find out (i) what would be the average queue length? (ii) What would be the average number of customers in the queuing system? 2. The cost of a machine is Rs. 6100 and its scrap value is Rs. 100. The maintenance costs found from experience are as follows: Year: Costs (in Rs.): 1 100 2 250 3 400 4 600 5 900 6 7 8 1200 1600 2000

Player I

When should the machine be replaced? OR 2. Solve the following LPP: Max Z = 36x1+50x2 Subjected to: 3x1+5x2 100; 4x1+2x2 96; 6x1+5x2 144; Where; x1 & x2 0 3. The primary contribution of the game theory has been its concepts rather than its formal application to solving real \problem Explain. OR 3. Find the critical path and critical duration

4. Find the initial BFS by VAM method and then solve the following transportation problem: D1 O1 23 O2 12 O3 22 Requirement 22 D2 27 17 28 35 OR 4. A factory manufacturers two products A and B on three machines, X, Y and Z. Product A requires 10 hours of machine X and 5 hours of machine Y and 1 hour of machine Z. The requirement of product B is 6 hours, 10 hours and 2 hours of machine X, Y and Z respectively. The profit contribution of product A and B are Rs. 23 per unit and Rs 32 per unit respectively. In the coming planning period the available capacity of machine X, Y and Z are 2500 hours, 2000 hours and 500 hours respectively. Find the optimal product mix for maximizing the profit by simplex method? 5. Explain VAM method of finding Initial basic feasible plan to transportation problem OR 5. Find the dual of the following LPP: Min z=2y+5z, Subjected to: x+y 2, 2x+y +6z 6, x-y+3z=4, Where; x, y, z 0 D3 16 20 12 25 D4 18 51 32 41 Availability 30 40 53