ws1

MBA593

MSP18

M.B.A. DEGREE EXAMINATION JUNE 2008.

(AY 20052006 onwards) OPERATIONS RESEARCH
Time : 3 hours Maximum marks : 75

Answer for 5 marks questions should not exceed 2 pages. Answer for 10/15 marks questions should not exceed 5 pages. PART A (3 5 = 15 marks) Answer any THREE questions. 1. What are programming? 2. 3. 4. 5. the assumptions of Linear

What is degeneracy in transportation problem? List out the characteristics of queuing system. Explain free float and free slack. What is saddle point?

ws1

PART B (4 15 = 60 marks) Answer any FOUR questions. 6. Solve the following LPP graphically : Minimize Z = 100 X1 + 80 X 2 subject to

5 X 1 + 10 X 2 50 8 X1 + 2 X 2 16 X1 , X 2 0
7. Find the initial solution for the following transportation problem using North West Corner Rule, Least Cost Method and Vogels Approximation Method. To X From Demand 8. Solve the game : Player B 4 Player A 2 3 1 4 Y Z W Supply 23 44 33 100 1 15 51 42 33 2 80 42 26 81 3 90 40 66 60 23 31 16 30

MBA593

ws1

9. 10. 11.

Explain the rules for constructing a network. What is decision tree? Explain its applications. Solve the assignment problem. Jobs I II III IV 30 28 32 34 15 12 10 16 1 10 22 Contractor 2 16 24 3 12 20 4 9 26

12.

Explain about Monte Carlo Simulation.

MBA593

Wk 6

MCA656

MCA-16

M.C.A. DEGREE EXAMINATION JUNE 2008.

Second Year/Fourth Semester OPERATIONS RESEARCH
Time : 3 hours Maximum marks : 75

Answer for 5 marks questions should not exceed 2 pages. Answer for 10/15 marks questions should not exceed 5 pages. PART A (5 5 = 25 marks) Answer any FIVE questions. 1. Explain nature of operations research and its limitations. 2. Solve the L.P.P by graphical method : Max Z = 3 x1 + 4 x 2 Subject to 4 x 1 + 2 x 2 80
2 x1 + 5 x 2 18 x1 , x 2 0

Wk 6

3.

Write the standard form of L.P.P. formulation of

4. Write the mathematical Transportation problem.

5. Explain the advantages and disadvantages of maintaining inventory. 6. Explain the characteristics of Queueing problem. the advantages and limitations of

7. Write simulation.

PART B (5 10 = 50 marks) Answer any FIVE questions. 8. Solve using simplex method : Max :
Z = 5 x1 + 3 x 2

Subject to x1 + x 2 2
5 x1 + 2 x 2 10 3 x1 + 8 x 2 12 ( x1 , x 2 0 )

MCA656

Wk 6

9.

Write dual of the L.P.P and solve : Max Z = 4 x 1 + 2 x 2 Subject to x1 + x 2 3

x1 x 2 2 ( x1 , x 2 0 ) .

10. Solve the transportation problem to minimise the total cost. Find optimum solution. Supply 7 4 6 9 4 4 3 3 5 2 5 8 16 14 20

Demand 11 9 22 8 11. Solve the travelling salesman problem.

A B C D E A B C E 3 6 3 3 5 2 3 6 5 6 4 2 2 6 6 3 3 4 6

D 2

MCA656

Wk 6

12. A Company uses 50,000 unit/year each costing Rs. 1.20. Order cost is Rs. 45 and inventory carrying costs are 15% of annual average inventory value (a) Find EOQ (b) If the company operates 250 days a year, the procurement time is 10 days and safety stock is 500 units, find re-order level, maximum and minimum inventory. 13. In a railway marshalling yard, goods trains arrive at a rate of 30 trains/day. Assuming inter arrival time follows an exponential distribution and the service time distribution is exponential with an average 36 minutes. calculate (a) (b) 14. Mean queue size The probability that queue size exceeds 10.

Solve the following game :

1 5 7 7 6 2 3 4 0 4 5 . 3

MCA656

wk7

MCA141

MCA16

M.C.A. DEGREE EXAMINATION JANUARY, 2009.

Fourth Semester/Second Year OPERATIONS RESEARCH
Time : 3 hours Maximum marks : 75 Answer for 5 marks question should not exceed 2 pages. Answer for 10 marks questions should not exceed 5 pages. PART A (5 5 = 25 marks) Answer any FIVE questions. 1. What is sample space? What are the different types of sample space? 2. Define slack and surplus variable. 3. What do you mean by unbalanced transportation problem? Give an example. 4. 5. 6. 7. State Bellman's principle of optimality. List out the applications of Goal programming. Why inventory should be maintained? What is two-person zero-sum game?

wk7

PART B (5 10 = 50 marks) Answer any FIVE questions. 8. Use simplex method to Minimize z = x1 3x 2 + 2x3 subject to the constraints :
3 x1 x 2 + 2x3 7 2x1 + 4 x 2 12 4 x1 + 3 x 2 + 8 x3 10 x1 , x 2 , x3 0.

9. Five jobs are to be processed and five machines are available. Any machine can process any job with the resulting profit (in rupees) as follows : Machine A B C D

1 32 38 40 28 40 2 40 24 28 21 36 Job 3 41 27 33 30 37 4 22 38 41 36 36 5 29 33 40 35 39 What is the maximum profit that may be expected if an optimum assignment is made? 2

MCA141

wk7

10.

Use dynamic programming to find the value of Maximize Z = y1 , y2 , y3 subject to the constrains :
y1 + y2 + y3 = 5 y1 , y2 , y3 0.

11.

Solve the non-linear programming problem : Minimize

2 2 2 Z = 2x1 24 x1 + 2x 2 8 x 2 + 2 x3 12 x3 + 200

subject to the constraints :

x1 + x2 + x3 = 11 x1 , x2 , x3 0 .
12. At a one man barber shop customers arrive according to Poisson distribution with a mean arrival rate of 5 per hour and his hair cutting time was exponentially distributed with an average hair cut taking 10 minutes. Calculate the following : (a) Average number of customers in the shop and the average number of customers waiting for hair cut. (b) The percentage of time an arrival can walk right in without having to wait. 3

MCA141

wk7

13.

Solve the following game I 1 4 2 4 Player A 3 4 4 4 5 4 Player B II III IV 2 3 3 3 3 0 1 7 4 3 2 3 5 1 2 V VI 1 2 1 2 2 1 2 2 2 2

14. The demand for a particular item is 18000 units per year. The holding cost per unit is Rs. 1.20 per year and the cost of one procurement is Rs. 400. Determine : (a) (b) (c) is Re. 1. Optimum order quantity Time between orders and Total cost per year when the cost of one unit

MCA141

Ws 6

MBA793

MSP18

M.B.A. DEGREE EXAMINATION JANUARY 2009. (AY 2005-06 batch onwards)

OPERATIONS RESEARCH
Time : 3 hours Maximum marks : 75

Answer for 5 marks question should not exceed 2 pages. Answer for 15 marks questions should not exceed 5 pages. PART A (3 5 = 15 marks)

Answer any THREE questions. 1. 2. 3. 4. 5. What is degeneracy? What is unbalanced transportation problem? What is Saddle Point? Differentiate PERT and CPM. Briefly explain the types of queuing system.

Ws 6

PART B (4

15 = 60 marks)

Answer any FOUR questions. 6. Solve the following L.P.P. graphically : Maximize z 2x1 3x 2 subject to
3x1 2x1 4 x1 4 x2 3x 2 5x 2 x1 , x 2 12 6 20 0.

7. Explain smoothing. 8.

resource

levelling

and

resource

Discuss the applications of game theory.

9. Explain the special cases of Linear Programming problem. 10. Solve the assignment problem given below : Machine A Job 1 2 3 4 3 7 3 6 2 B 6 1 8 4 C 2 3 5 3 D 4 2 8 7

MBA793

Ws 6

11. Draw the network diagram and calculate the critical path, critical time from the following : Activity : Predecessor : Estimated time : 12. A 5 B A 4 C 7 D B, C 3 E B 4 F D, E 2

Solve the transportation problem given below : To From A B C 17 20 25 15 19 16 16 17 17 X Y Z

MBA793

Ws 6

MCA-426

MCA16

M.C.A. DEGREE EXAMINATION JUNE 2009.

Fourth Semester / Second Year OPERATIONS RESEARCH
Time : 3 hours Maximum marks : 75

PART A (5 5 = 25 marks) Answer any FIVE questions. 1. 2. Classify the OR models of structure. Use graphical method to solve : Maximize z = 2x1 + x 2 subject to the constraints :

x1 + 2x 2 10 x1 + x 2 6 x1 x 2 2 x1 2x 2 1 x1 , x 2 0.

Ws 6

Write the mathematical 3. Assignment Problem. 4. 5. 6. 7.

formulation

of

Define (a) All IPP (b) Mixed IPP. Describe the characteristics of queueing system. Write the advantages of simulation. Obtain the necessary conditions for the NLPP :
2 2 2 Maximize z = x1 + 3x 2 + 5x3

subject to the constraints :

x1 + x 2 + 3x 3 = 2 5x1 + 2x 2 + x 3 = 5 x1 , x 2 , x 3 0. PART B (5 10 = 50 marks) Answer any FIVE questions. 8. Use Simplex method to Maximize z = 3x1 + 5x2 subject to the constraints :
3x1 + 2x 2 18 x1 4 x2 6 x1 , x 2 0.
2

MCA-426

Ws 6

9. Obtain an optimum basic feasible solution to the following Transportation Problem : Warehouse W1 W2 W3 W4 F1 Factory F2 F3 19 70 40 5 30 30 8 8 50 40 70 7 10 60 20 14 7 9 18 Capacity

Requirements 10. Find the Optimum integer solution to the LPP using Gomory's constraint : Maximize z = 2x1 + 2x2 Subject to the constraints : 5x1 + 3x 2 8 x1 + 2x 2 4 x1 , x 2 0 and are integers. 11. Use the Khun-Tucker conditions to solve the following NLPP :
2 2 Maximize z = 2x1 + 2x1 x 2 7 x 2

subject to the constraints :

2x1 + 5x 2 98 x1 , x 2 0.
3

MCA-426

Ws 6

12.

Consider the EOQ system :

Annual consumption is 12000 units at the cost of Rs. 7.50 per unit. Set-up cost is Rs. 6 and the average inventory holding cost is Rs. 0.90 per unit. Normal lead time is 15 days and maximum lead time is 20 days. Calculate the following : (a) (b) (c) (d) Optimal order quantity Time between order Buffer stock ROL.

13. Given an arrival rate of 20 per hour, is it better for a customer to get service at a single channel with mean service rate of 22 customers or at one of two channels in parallel, with mean service rate of 11 customers for each of the two channels? Assume both the queues are M/M/S type. 14. A and B play game in which each has three coins, a 5 paise, a 10 paise and a 20 paise. Each selects a coin without the knowledge of the other's choice. If the sum of the coins is an odd amount, A wins B's coin, if the sum is even, B wins A's coin. Find the best strategy for each player and the value of the game.

MCA-426

Ws 6

MBA343

MSP18

M.B.A. DEGREE EXAMINATION JUNE 2009. (AY 2005-06 batch onwards) First Year
OPERATIONS RESEARCH
Time : 3 hours Maximum marks : 75 PART A (3 5 = 15 marks) Answer any THREE questions. All questions carry equal marks. 1. Define OR and explain its characteristics. 2. Write the algorithm for solving transportation problem using North West Corner rule method. 3. 4. 5. Write a short note on dummy. What is degeneracy in transportation problem? What are the rules for determining saddle point?

PART B (4 15 = 60 marks) Answer any FOUR questions. All questions carry equal marks. 6. Operations research is a tool of management. Discuss.

modern

Ws 6

7.

Solve the following LPP using simplex method. Maximize z = 3x + 9 y subject to the constraints

x + 4y 8 x + 2y 4 x , y 0.
8. Find the optimum solution to the following transportation problem. Use least cost method to find initial basic feasible solution. Factory Warehouse Capacity A Madras Bombay Bangalore Demand 42 40 39 80 B 48 49 38 90 C 38 52 40 110 D 37 51 43 160 160 150 190

9. A business man has three alternatives open to him each of which can be followed. The conditional pay offs (in Rs.) for each action event combinations are given below : Alternative Payoffs conditional events A X Y Z 8 4 14 B 0 12 6 2 C 10 18 0 D 6 2 8

MBA343

Ws 6

Determine which alternative should the business men choose. If he adopts (a) (b) (c) Maximin criterion Maximax criterion Minimax cirterion.

10. The following table gives the activities and other relevant data for a project. Activity Normal time (days) 4 2 5 7 7 2 5 Crash time (days) 3 2 4 5 6 1 4 Normal cost (Rs.) 600 400 750 400 800 500 600 Crash cost (Rs.) 800 400 500 600 1,000 650 850

12 13 14 23 25 35 45

Indirect cost per day for the project is Rs. 200. (a) (b) (c) project. Draw the network of the project Find the normal duration of the project Find the optimum duration and cost of the

MBA343

Ws 6

11.

Solve the following assignment problem. Workers A 1 Task 2 3 4 5 10 30 10 B 20 30 20 2 C 10 5 12 4 D 15 10 20 32

12. A bank is considering opening ATM for customer service. Management estimates that customers arrive at the rate of 12 per hour. The service at the counter is 3 minutes for every customer. Assuming Poisson arrivals find (a) (b) (c) (d) Utilization of ATM Average number in the system Average waiting time in the line Average waiting time in the system.

MBA343

MBA173

MSP-18

M.B.A. DEGREE EXAMINATION JUNE 2010.

First Year OPERATIONS RESEARCH Time : 3 hours Maximum marks : 75

PART A (3 5 = 15 marks) Answer any THREE questions. All questions carry equal marks. 1. 2. 3. 4. 5. What are the limitations of LPP? Describe the unbalanced transportation problem. Explain the process of resource leveling. What are the methods of network construction? Write short notes on single channel single server system.

PART B (4 15 = 60 marks) Answer any FOUR questions. All questions carry equal marks. 6. Operations Research is a bunch of mathematical techniques Comment. 7. Solve the following LPP using simplex method : Maximize Z = 2x + y subject to the constraints.

4 x + 3 y 12 4x + y 8 4x y 8 x , y 0. 8. Find the optimum solution to the following transportation problem. Use NWC rule method for initial basic solution. F1 P1 P2 P3 8 12 9 F2 10 9 F3 7 4 F4 6 7 8 Available 50 40 30

11 10

Requirement 25 32 40 23
2

MBA173

9.

Solve the following assignment problem. Men A B C D 1 10 25 15 20 JOBS 2 15 30 5 15 3 35 20 12 24 4 17 25 24 30

10.

A project consists of the following jobs with the following predecessor relations and time constraints. Job Predecessor Time (days) A B C D E F G H I J K L None None A, B B B F, C B E, H E, H E, H C, D, F, J K 3 3 4 2 5 1 3 6 4 4 2 1 5

MBA173

(a) (b) (c) 11.

Draw the project network. Determine the duration of the project. Find total, free and independent floats.

A tourist cab owner has 25 taxis in operation. He keeps three drivers as reserve to attend calls, in case the scheduled driver reports sick. The probability distribution of sick drivers is given below : Number sick 0 1 2 3 4 5 Probability 0.20 0.25 0.20 0.15 0.12 0.08

Use Monte Carlo method to estimate the utilization of reserve drivers and the probability that at least one taxi will be off the road due to non availability of the driver. 12. Solve the following matrix game approximately. Player B 3 Player A 3 1 3 3 1

4 3 3

MBA173

MCA766

MCA16

M.C.A. DEGREE EXAMINATION JUNE, 2010.

Second Year
OPERATIONS RESEARCH Time : 3 hours Maximum marks : 75

PART A (5 5 = 25 marks) Answer any FIVE questions. 1. 2. Classify the OR model and explain briefly. Use graphical method to solve Max z = 2x1 + x 2 Subject to the constraints :

x1 + 2x 2 10 x1 + x2 6 x1 x 2 2 x1 2x 2 1 x1 , x 2 0 .

3. 4. 5.

Describe the Vogels approximation method. Describe the applications of Goal Programming. Solve the nonlinear programming problem :
2 2 2 Minimize z = 2x1 24 x1 + 2x 2 8x 2 + 2x 3 12 x 3 + 200

Subject to the constraints :

x1 + x 2 + x 3 = 11 x1 , x 2 , x 3 0 .
6. 7. What are the various costs involved in inventory? Two players A and B match coins. If the coins match, then A wins one unit of value, if the coins do not match, then B wins one unit of value. Determine the optimum strategies for the players and the value of the game. PART B (5 10 = 50 marks) Answer any FIVE questions. 8. Use simplex method to solve : Max z = x1 x 2 + 3x 3 Subject to the constraints :

x1 + x 2 + x3 10 2x1 x3 2 2x1 2x 2 + 3x 3 0 x1 , x 2 , x 3 0 .
2

MCA766

9.

10.

A company is faced with the problem of assigning six different machines to five different jobs. The costs are estimated as follows : Job 1 2 3 4 5 1 2.5 5 1 6 1 2 2 5 1.5 7 3 Machine 3 3 6.5 2 8 3 4 3.5 7 2 9 4.5 5 4 7 3 9 6 6 6 9 5 10 6 Solve the problem assuming that the objective is to minimize total cost. Find the optimum integer solution to the L.P.P. : Max z = 2x1 + 2x 2 Subject to the constraints : 5x1 + 3x 2 8 x1 + 2x 2 4 x1 , x 2 0 and are integers. The profit associated with each of the four activities as a function of the man hours allocated to each is given in the following table. If man hours are available each day, how should the allocation of time be made so that the profit per day is maximized? H: 0 1 2 3 4 5 6 7 8 9 12 14 15 16 g1 (H) : 0 1 3 6 11 13 15 16 17 g2 (H) : 0 2 5 8 g3 (H) : 0 3 7 10 12 13 13 13 13 g4 (H) : 0 2 5 8 10 10 12 13 14 Use dynamic programming to solve the above problem. 3 MCA766

11.

12.

In a railway marshalling yard, goods trains arrive at a rate of 30 trains per day. Assuming that the inter arrival time follows an exponential distribution and the service time distribution is also exponential with an average 36 minutes. Calculate the following : (a) (b) (c) The mean queue size The probability that the queue size exceeds 10 If the input trains increases to an average 33 per day, what will be the change in (a) and (b)?

13.

Solve the following game by using the principle of dominance : Player B I 1 4 2 4 Player A 3 4 4 4 5 4 II III IV V VI 2 3 3 3 3 0 1 7 4 3 2 3 5 1 2 1 2 1 2 2 1 2 2 2 2

14.

Describe the various methods of obtaining random numbers in computer simulation.

MCA766