Operations Research - May 2015
Mechanical Engineering (Semester 7)
TOTAL MARKS: 80
TOTAL TIME: 3 HOURS (1) Question 1 is compulsory.
(2) Attempt any three from the remaining questions.
(3) Assume data if required.
(4) Figures to the right indicate full marks.
1 (b) Explain Bellman's principle of optimality. (4 marks)
1 (c) Explain the applications of linear programming. (4 marks)
1 (d) What do you understand by a queue? Give some applications of queuing theory. (4 marks)
1 (e) Explain Johnson's alorithm. (4 marks)
1 (f) Explain degeneracy in the transportation problem. (4 marks)
2 (a) A manufacture has five lathes and three milling machines in his workshop and produces an assembly that consists of 2 units of part A and three units of parts B. The processing time for each part on the two types of machines is given below.
In order to maintain the uniform work load on the two types of machines, the manufacturer has a policy that no type of machine should run more than 40 minutes per day longer than other machine. Formulte the problem as 1.7 problem if the objective is to produce the maximum number of assemblies in any 8 how working day.
|Part||Processing time in minutes on|
2 (b) Solve the following L.P. Problem by simplex method.
X1, X2, X3 ≥0. (10 marks)
3 (a) Use two phase method to
Subject to 2X1+X2 ≤1
X1, X2 ≥0 (10 marks)
3 (b) A company has a team of four salesmen and there are four districts where the company wants to start its business. After taking into account the capabilities of salesmen and the nature of districts, the company estimates that the profit per day in rupees for each salesman in each district is as below.
Find the assignment of salesmen to various districts which will yeild maximum profit.
4 (a) There are five jobs, each of which is to be processed through three machines A, B and C in the order ABC. Processing times in hours are:
Determine the optimum sequence for the five jobs and minimum elapsed time. Also find the idle time for the three machines and waiting time for the jobs.
4 (b) Solve the following problem using Big M method,
Subject to 6X1+8X2≥100
X1, X2 ≥ 0. (10 marks)
5 (b) Solve the following transportation problem where the cell entries are the unit costs.
5 (b) The cost of a machine is Rs 6,100 and its scrap value is Rs. 100. The maintenance costs found from experience are as follows:
When should the machine be replaced?
| Maintenance |
6 (a) Solve the following L.P. problem by dynamic programming approach.
X1, X2≤0. (10 marks)
6 (b) A particular item has demand of 9,000 units / year. The cost of one procurement is Rs. 100 and the holding cost per unit is Rs. 2.40 per year. The replacement is instantaneous and no shortage are allowed. Determine
i) The economic lot size
ii) the number of orders per year.
iii) the time between orders.
iv) the total cost per if the cost of one unit is Re. 1. (10 marks)
7 (a) Reduce the following game by dominance and find the game value:
| Player A || |
7 (b) A bakery keeps stocks of a popular brand of cake. Daily demand based on past experience is given below:
Consider the following sequence of random numbers:
48, 78, 09, 51, 56, 77, 15, 14, 68 and 09
i) Using the sequence, simulate the demand for next 10 days.
ii) Find the stock situation if the owner of the bakery decides to make 35 cakes every day. Also estimate the daily average demand for the cakes on the basis of the simulated data.
Attempt any five:
1 (a) Briefly explain the Monte - Carlo Simulation with suitable example.(4 marks)