Reg. No.

M.E./M.Tech. DEGREE EXAMINATION, JANUARY 2011. First Semester

Computer Science and Engineering

(Common to Information Technology, Software Engineering and Network Engineering) 281110 OPERATIONS RESEARCH (Regulation 2010) Time : Three hours

PART A (10 2 = 20 marks) 1. 2. 3.

What are the different parts of solution of queuing models? Write down the Littles formulae in queuing model. Write down the Pollaczek-Khinchin queuing system. (P K) transform in non Poisson

4. 5. 6. 7.

Explain queues in Tandem and classify the above. Explain the elements of a simulation model. Explain the different types of simulation. Determine the initial basic feasible solution to the following transportation problem using north west corner rule. To 5 4 2 8 6 4 1 7 3 22 6 15 Availability 5 8 From 4

07

75

75
7 12 17 9 Demand

07
Answer ALL questions.

75
Maximum : 100 marks

Question Paper Code :

20142

07

8. 9.

Explain degenerate solution in LPP.

Obtain the necessary conditions for the non-linear programming problem. Max z = x1 + 3x 2 + 5x3
2 2 2

Subject to the constraints

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

State sufficient condition of Kuhn - Tucker conditions. PART B (5 16 = 80 marks)

11.

(a)

(b)

At a port there are 6 unloading berths and 4 unloading crews. When all the berths are full, arriving ships are diverted to an over flow facility 20 kms down the river. Tankers arrive according to a Poisson process with a mean of 1 for every 2 hours. It takes for an unloading crew, on the average, 10 hours to unload a tanker; the unloading time follows an exponential distribution. Determine (i) (ii) How many tankers are at the port on the average? How long does a tanker spend at the port on the average?

(iii) What is the average arrival rate at the overflow facility?

75

07

12.

(a)

A roofing company installs single roofs on new and old residences in a part of city. Prospective customers request the service randomly at the rate of nine jobs per 30 day month and are placed on the waiting list to be processed on a FCFS basis. Homes sizes vary, but it is fairly reasonable to assume that the roof areas are uniformly distributed between 150 and 300 squares. The work crews can usually complex 75 squares a day. Determine the following. 2

75

07
Or

At a railway station, only one train is handled at a time. The railway yard is sufficient only for two trains to wait while other is given signal to leave the station. Trains arrive at the station at an average rate of 6 per hour and the railway station can handle them on an average of 12 per hour, Assuming Poisson arrivals and exponential service distribution, find the steady state probabilities for the number of trains in the system. Also find the average waiting time of a new train coming into the yard. If the handling rate is reduced to half, what is the effect of the above results?

75
20142

07

(i) (ii)

Companys average backlog of roofing jobs.

The average time a customer waits until a roofing job is completed.

Or (b)

A barber shop has space to accommodate only 10 customers. He can server only one person at a time, If a customer comes to his shops and finds it full he goes to the next shop. Customers randomly arrive at an average rate at d = 10 per hour and the barbers service time is negative exponential with an average of 1 / = 5 minutes per customer. (i) Write recurrence relations for the steady state queuing system (FIFO) for above.

respectively in the shop. 13. (a)

Use MonteCarlo technique to estimate the area of a circle whose equation is given by ( x 1) 2 + ( y 2) 2 = 25 . Or

(b)

Customers arrive at a milk booth for the required service. Assume that inter-arrival and service times are constants and given by 1.8 and 4 time units, respectively. Simulate the system by hand computations for 14 time units. What is the average waiting time per customer? What is the percentage idle time of the facility? [Assume that the system starts at t = 0).

14.

(a)

Solve the following LPP by using simplex method. Max z = 4 x1 + x 2 + 3 x3 + 5x 4 Subject to the constraints

07

4 x1 + 6 x 2 + 5 x3 + 4 x 4 20

3x1 2x 2 + 4 x3 + x 4 10 8 x1 3x 2 + 3x3 + 2 x 4 20 x1 , x 2 , x3 , x 4 0.
Or

75

75
3

07

(ii)

Determine Po and Pn probability of having O and n customers

75

(iii) If the work crew is increased to the point where they can complete 150 squares a day, how would this affect the average time until a job is completed?

07
20142

(b)

Solve the following LPP by using Two-Phase method. Max z = 2 x1 + x 2 + x3 Subject to the constraints

4 x1 + 6 x 2 + 3x 3 8, 3x1 6 x 2 4 x3 1, 2 x1 + 3x 2 5 x3 4, x1 , x 2 , x3 0 .
15. (a)

Solve the following NLPP by using Kuhn-Tucker conditions. Max z = x1 x 2 x3 + 4 x1 + 6 x 2 Subject to the constraints
2 2 2

x1 + x 2 2, 2 x1 + 3x 2 12, x1 , x 2 0.
Or (b) Solve the following QPP.

Max z = 10 x1 + 25x 2 10 x1 x 2 4 x1 x 2 Subject to the constraints

x1 + 2x2 10, x1 + x2 9, x1 , x 2 0 .

75

07
4

75

07
2 2

75
20142

07