14ME3603 VR14 Reg.

No:

7. Find the optimal schedule for a project for which the data is given VELAGAPUDI RAMAKRISHNA
below 15M SIDDHARTHA ENGINEERING COLLEGE
Normal Crash (AUTONOMOUS)
Acitivity
Time (Hr) Cost ( ₹) Time (Hr) Cost ( ₹)
1-2 8 1000 6 2000 III/IV B.Tech. DEGREE EXAMINATION, OCTOBER, 2020
1-3 4 1500 2 3500 Sixth Semester
2-4 2 500 1 900
MECHANICAL ENGINEERING
2-5 10 1000 5 4000
3-4 5 1000 1 2000 14ME3603 OPERATIONS RESEARCH
4-5 3 800 1 1000
Time: 3 hours Max. Marks: 70
UNIT-IV Part-A is compulsory
Answer One Question from each Unit of Part - B
8. Solve the following game by graphical method 15M Answer to any single question or its part shall be written at one place only
1 3 11
PART-A
8 5 2
10 x 1 = 10M

(or) 1. a. What are the limitations of OR?

b. List out the assumptions of LPP.
9. There are 8 jobs, each of which has to go through the machines A
c. What is the minimum requirement for a transportation problem to
and B in the order AB. Processing time in hours are given below
have a feasible solution?
Job 1 2 3 4 5 6 7 8 d. How do you solve an unbalanced transportation problem?
Machine A 5 4 22 16 15 11 9 4 e. What is the procedure to solve unbalanced maximization
Machine B 6 10 12 8 20 7 2 21 assignment problem?
f. What is the distribution followed by arrival and departure in queuing
Determine the sequence that will minimize the total elapsed time T. system?
Find T and Idle time for machines A and B. 15M
g. What is crashing?
*** h. Give the rules for drawing a network diagram.
i. What is a saddle point?
j. What are the assumptions made in sequencing problem?
Page 4 of 4 Page 1 of 4
 14ME3603 VR14 14ME3603
PART-B D1 D2 D3 D4 ai

4 x 15 = 60M O1 4 6 8 13 50

UNIT-I O2 13 11 10 8 70
O3 14 4 10 13 30
2. a. Solve the following LPP 10M
Max z = 20x 1+24x 2 04 9 11 13 8 50
Subject to 2x 1+3x 2  1500 bj 25 35 105 50
3x 1+2x 2  1500 (or)
x 1 + x 2  600
x 2  250 and x 1, x 2  0 5. Solve the following assignment problem 15M

b. Define 1 2 3 4 5
i) Bounded solution
A 16 13 17 19 20
ii) Unbounded solution
iii) Feasible solution B 13 12 13 16 17

iv) Infeasible solution C 14 11 15 17 18

v) Optimal solution 5M D 5 5 8 8 11
(or) E 6 4 7 8 10

3. Solve the following LPP 15M UNIT-III

Max z = 4x 1 + 5x 2 + 2x 3
6. a. Explain the characteristics of a queuing system 5M
Subject to x 1 + 3x 2 + x 3  12
x1 + x2 + x3 = 6 b. Given average arrival rate = 4/hour, average service time =
and x 1, x 2, x 3  0 6minutes. Calculate
i) Proportion of time that the system is empty
UNIT-II ii) Probability of finding at least one customer in the shop
iii) Average number of customers in the system
4. Solve the following transportation problem 15M iv) Average time including service, spent by a customer
v) Utilization rate of service 10M

(or)

Page 2 of 4 Page 3 of 4