H.T.

No: Subject Code: 18MEMET7010

SASI INSTITUTE OF TECHNOLOGY & ENGINEERING

January/Feb - 2022
IV B.Tech. I Sem Regular Examinations
OPERATION RESEARCH
Time: 3 hours Max. Marks: 70
Instructions:
1. Answer all question from Part-A. Each question carries one mark
2. Answer one full question from each unit in Part-B. Each full question carries 12marks
PART-A
a Write the definition of OR L1 CO1 [1M]
b What is meant by LPP L1 CO1 [1M]
c Write the degeneracy condition in TP L1 CO2 [1M]
d What is meant by unbalanced assignment problem? L1 CO2 [1M]
e Discuss about idle time of machine? L2 CO3 [1M]
1
f Discuss about early failure or infant failure? L2 CO3 [1M]
g Write about buffer inventory? L1 CO4 [1M]
h Write a note on waiting line situation L1 CO4 [1M]
i Explain about saddle point? L2 CO5 [1M]
j Explain about CPM? L1 CO5 [1M]
PART-B
UNIT-I
2 a A person wants to decide the constituents of a diet which will fulfill his
daily requirements of proteins, fats and carbohydrates at the minimum
cost. The choice is to be made from four different types of foods. The
yields per unit of these foods are given in table below:
Yield per unit Cost per
Food type
Proteins Fats carbohydrates unit(Rs.)
L3 CO1 [6M]
1 3 2 6 45
2 4 2 4 40
3 8 7 7 85
4 6 5 4 65
Min requirement 800 200 700
Formulate the linear programming model for the problem
b Solve the following linear programming problem:
              Maximize Z= 6x1 + 11x2                                                     
              subject to:   2x1 + x2 ≤ 104 L2 CO1 [6M]
                                      x1 + 2x2 ≤ 76                                                 
                                  and x1 ≥ 0, x2 ≥ 0.
OR
3 a

L4 CO1 [12M]

UNIT-II
 Optime the transportation problem by using U-V method
D1 D2 D3 D4 Supply
O1 1 2 1 4 30
4 a L2 CO2 [12M]
O2 3 3 2 1 50
O3 4 2 5 9 20
Demand 20 40 30 10
OR
Find the assignment that minimizes total machining time. The data is
A B C D
M/C1 4 9 8 5
5 a L1 CO2 [12M]
M/C2 5 4 3 6
M/C3 7 8 6 12
M/C4 10 9 6 7
UNIT-III
6 a Find the sequence that minimises the total elapsed time required to
complete following tasks on two machines
Task 1 2 3 4 5 6 7 8 9
L4 CO3 [8 M]
M/C-A 2 5 4 9 6 8 7 5 4
M/C-B 6 8 7 4 3 9 3 8 11
b Discuss the use of probabilities in replacement policies. L3 CO3 [4 M]
OR
a Explain the relevance and importance of Gantt chart in sequencing? L2 CO3 [4M]
There are 1000 bulbs in the system survival rate is given below
Week 0 1 2 3 4
7 Bulb in operation at
1000 850 500 200 100
b the end of week L4 CO3 [8 M]
The group replacement of 1000 bulbs costs Rs. 100 and individual
replacement is Rs. 0.50 paise per bulb. Suggest suitable replacement
policy.
UNIT-IV
Discuss the working rule of probabilistic model without setup cost and L1 CO4 [6M]
a
8 instantaneous demand.
b Write the classification of queuing system. L4 CO4 [6M]
OR
State some of the important distributions of arrival intervals and service
a L4 CO4 [5M]
time
A shopkeeper has a uniform demand for an item at the rate of 50 items
per month. He buys from supplier at a cost of Rs.6 per item and the cost
of ordering is Rs.10 each time. If the stock holding costs are 20% per
9
year of stock value, how frequently should he replenish his stocks? Now
b L4 CO4 [7M]
suppose the supplier offers a 5% discount, on orders between 200 and
999 items and a 10% discount on orders exceeding or equal to 1000. Can
the shop keeper reduce his costs by taking advantage of either of these
discounts?
UNIT-V
1 a A project has the following time schedule: L4 CO5 [12M]
 Time in Time in
Activity Activity
weeks weeks
1-2 2 4-6 3
1-3 2 5-8 1
1-4 1 6-9 5
2-5 4 7-8 4
0
3-6 8 8-9 3
3-7 5
Construct PERT network and compute
i. TL and TE for each event
ii. Float for each activity
Critical path and its duration
OR
a What are the limitations of game theory? L2 CO5 [4 M]
In a game of matching coins, player A wins Rs.2 if there are two heads,
1
wins nothing if there are two tails and loses Re1 when there are one head
1 b L4 CO5 [8 M]
and one tail. Determine the payoff matrix, best strategies for each player
and the value of game to A.

*****