Reg. No.

Question Paper Code:

W7671

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

Computer Science and Engineering

MA 9219 OPERATIONS RESEARCH

(Common to M.E. Network Engineering, M.E. Software Engineering and M.Tech. Information Technology) (Regulation 2009) Time: Three hours Answer ALL Questions

PART A (10 2 = 20 Marks) 1. 2. 3. 4. 5. 6.

Explain the main characteristics of the queuing system. State the steady-state measures of performance in a queuing system. State Pollaczek-Khintchine formula for non-Markovian queuing system. Mention the different types of queuing models in series. What is Monte Carlo simulation? Mention its advantages. Give one application area in which stochastic simulation can be used in practice. Define slack and surplus variable in a linear programming problem. Mention the different methods to obtain an initial basic feasible solution of a transportation problem. State the Kuhn-Tucker conditions for an optimal solution to a Quadratic programming problem. Define Non-linear programming problem. Mention its uses.

7. 8.

50

9.

10.

50

50
Maximum: 100 Marks

PART B (5 16 = 80 Marks) 11. (a) (i) (ii) Explain M/M/1 (N/FCFS) system and solve it under steady-state condition. (8) 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 (the time taken to hump a train) distribution is also exponential with an average 36 minutes. Calculate the following (1) (2) The average number of trains in the queue

The probability that the queue size exceeds 10. If the input of trains increases to an average 33 per day, what will be changed in (1) and (2)? (8) Or

(b)

(i) (ii)

Explain the model M/M/S in case of first come first served basis. Give a suitable illustration. (8) An automobile inspection in which there are three inspection stalls. Assume that cars wait in such a way that when stall becomes vacant, the car at the head of the line pulls up to it. The station can accommodate almost four cars waiting (Seven in station) at one time. The arrival pattern is Poisson with a mean of one car every minute during the peak hours. The service time is exponential with mean of 6 minutes. Find the average number of customers in the system during peak hours, the average waiting time and the average number per hour that cannot enter the station because of full capacity. (8) Discuss the queuing model which applied to queuing system having a single service channel, Poisson input, exponential service, assuming that there is no limit on the system capacity while the customers are served on a first in first out basis. (7) 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. It is assumed that because of his excellence, reputation customers were always willing to wait. Calculate the following (1) (2) (3) Average number of customers in the shop and the average number of customers waiting for a hair cut. The percentage of customers who have to wait prior of getting into the Barbers chair. The percent of time an arrival can walk without having to wait. (9) Or 2

12.

(a)

(i)

(ii)

50

50

50
W 7671

(b)

(i) (ii)

13.

(a)

(i) (ii)

Distinguish between solutions derived from simulation models and solutions derived from analytical models. (6) Describe the kind of problems for which Monte Carlo will be an appropriate method of solution. (5)

(iii) Explain what factors must be considered when designing a simulation experiment. (5) Or (b) (i) (ii) Discuss stochastic simulation method of solving a problem. What are the advantages and limitations of stochastic simulation? (9) What are random numbers? Why are random numbers useful in simulation models and solutions derived from analytical models? (7) Explain various steps of the simplex method involved in the computation of an optimum solution to a linear programming problem. (4) Explain the meaning of basic feasible solution and degenerate solution in a linear programming problem. (4) (8)

14.

(a)

(i)

(ii)

(iii) Solve the following LPP using the simplex method. Max z = 5 x1 + 3 x 2

subject to
x1 + x 2 2 5 x1 + 2x 2 10

50

(b)

(i)

What is degeneracy in transportation problem? How is transportation problem solved when demand and supply are not equal? (8)

50
x1 , x 2 0 Or

3 x1 + 8 x 2 12

7
3

50
W 7671

Truck drivers who arrive to unload plastic materials for recycling currently wait an average of 15 minutes before unloading. The cost of driver and truck time wasted while in queue is valued Rs. 100 per hour. A new device is installed to process truck loads at a constant rate of 10 trucks per hour at a cost of Rs. 3 per truck unloaded. Trucks arrive according to a Poisson distribution at an average rate of 8 per hour. Suggest whether the device should be put to use or not. (8)

Explain briefly open and closed networks model in a queuing system. (8)

(ii)

Warehouse W1 W2 W3 Supply F1 16 20 12 200 Factory F2 14 8 18 160 F3 26 24 16 90 Demand 180 120 150 450

Determine the optimal distribution for this company to minimize total shipping cost. (8) 15. (a) (i) What is meant by quadratic programming? How does a quadratic programming differ from a linear programming problem? (8) Explain briefly the various methods of solving a quadratic programming problem. (8)

(ii)

(b)

(i)

(ii)

Solve the following quadratic programming problem Maximize z = 2x1 + x 2

2 x1

50
2 x1 + 3 x 2 6 2 x1 + x 2 4 and x1 , x 2 0

Explain the role of programming problem.

7
Or Lagrange 4

multipliers

Subject to the constraints

50

50
in a non-linear (6) (10)

7
W 7671

A company has factories at F1 , F2 and F3 which supply to warehouses at W1 , W2 and W3 . Weekly factory capacities are 200, 160 and 90 units respectively. Weekly warehouse requirement are 180, 120 and 150 units respectively. Unit shipping costs (in rupees) are as follows.