Question Paper: Operations Research : Question Paper Dec 2016 - Mechanical Engineering (Semester 7) | Visveswaraya Technological University (VTU)
0

Operations Research - Dec 2016

Mechanical Engg. (Semester 7)

TOTAL MARKS: 100
TOTAL TIME: 3 HOURS
(1) Question 1 is compulsory.
(2) Attempt any four from the remaining questions.
(3) Assume data wherever required.
(4) Figures to the right indicate full marks.
1(a) Briefly explain the scopes of Operation Research.(5 marks) 1(b) A farmer has 100 acre farm. He can sell all tomatoes, lettuce or radishes and can rise the price to obtain Rs 1.00 per kg for tomatoes, Rs 0.75 a head for lettuce and Rs 2.00 per kg for radishes. The average yields per acre is 2000 kgs of tomatoes, 3000 heads of lettuce and 1000 kgs of radishes. Fertilizers are available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kgs for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man days for tomatoes and radishes and 6 man days for lettuce. A total of 400 man days of labour are available at Rs 20 per man day. Formulate this problem as a linear programming model to maximize the farmer's total profit.(15 marks) 2(a) Write the dual of the following LPP. Minimize Z = 3x1-6x2+4x3 Subject to 4x1+3x2+6x3≥9
1xsub>1+2x2+3x3≥6
6x1-2x2-2x3≤10
x1-2x2+6x3≥4
2x1+5x2-3x3≥6
x1, x2, x3≥0.
(5 marks)
2(b) Solve the following Linear Programming problem. Maximize Z = x1+2x2+3x3-x4 Subject to x1+2x2+3x3=15
2x1+x2+5x3=20
x1+2x2+x3+x4=10
x1, x2, x3,x4≥0. Solve by using Two phase method.
(15 marks)
3(a) ABC Limited has three production shops supplying a product to 5 warehouses . The cost of production varies from shop to shop, cost of transportation from shop to shop cost of transportation from shop to warehouses also varies. Each shop has a specific production capacity of each warehouse has certain amount of requirement. The cost of transportation are as given below:

Shop Warehoouse Capacity Cost of production
  I II III IV V
A 6 4 4 7 5 100 14
B 5 6 7 4 8 125 16
C 3 4 6 3 4 17 15
Requirement 60 80 85 105 70    
Find the optimum quantity to be supplied from each shop to different warehouse at minimum cost.(12 marks) 3(b) A ABC company has 5 tasks and 5 persons to perform. Determine the optimal assignment that minimizes the total cost.
Jobs                         Machines
A B C D E
P 6 7 5 9 4
Q 7 5 10 9 6
R 5 4 3 6 5
S 8 3 5 6 4
T 4 7 5 6 6
(8 marks)
4(a) Explain the importance of integer programming.(5 marks) 4(b) Solve the following linear programming by Gomory technique: Maximize Z = x1+x2 Subject to 2x1+x2≤6
4x1+5x2≤20
x1 x2≥0 and integers.
(15 marks)
5(a) Define the following terms with reference to PERT: i) Total float ii) Free float iii) Independent float.(6 marks) 5(b) A project schedue has the following characteristics.
Activity Time (weeks) Activity Time (weeks)
1-2 4 5-6 4
1-3 1 5-7 8
2-4 1 6-8 1
3-4 1 7-8 2
3-5 6 8-10 5
4-9 5 9-10 7
i) Draw the network and find the critical path.
ii) Compute EST,EFT,LST,LFT, total float for each activity.
(14 marks)
6(a) Briefly explain queuing system and its characteristics.(6 marks) 6(b) Arrival rate of telephone call at a telephone booth are according to Poisson distribution. With an average time of 9 minutes between two consecutive arrivals. The length of telephone call is assumed to be exponentially distributed with mean 3 minutes. i) Determine the probability that a person arriving at the booth will have to wait.
ii) Find the average queue length.
iii) The telephone company will install a second booth when convinced that an arrival would expect to have to wait at least 4 minutes for the phone. Find the increase in flow rate of arrivals which will justify a second booth.
iv) What is the probability that he will have to wait for more than 10 minute before the phone is free?
(14 marks)
7(a) Solve the following game by Graphical method.
!mage
(14 marks)
7(b) Use Dominance Rule to find the optimum stratgies for both the player
!mage
(6 marks)
8(a) Define i) Total elaped ii) Idle time.(4 marks) 8(b) Find the sequence that minimized the total time required in performing the job on 3 machines in the order CBA.
!mage
(16 marks)

ADD COMMENTlink
written 23 months ago by gravatar for Team Ques10 Team Ques10410
Please log in to add an answer.