0% found this document useful (0 votes)
128 views3 pages

Operation Research Model Paper 3

The document contains a 10 page exam for an Operations Research course. It includes 10 multiple choice questions, 2 long form questions per unit on topics like linear programming, transportation problems, queuing theory, and game theory. Students are asked to solve problems, derive formulas, and discuss concepts from the course.

Uploaded by

Krishna Murthy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
128 views3 pages

Operation Research Model Paper 3

The document contains a 10 page exam for an Operations Research course. It includes 10 multiple choice questions, 2 long form questions per unit on topics like linear programming, transportation problems, queuing theory, and game theory. Students are asked to solve problems, derive formulas, and discuss concepts from the course.

Uploaded by

Krishna Murthy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

H.T.

No: Subject Code: 18MEMET7010

SASI INSTITUTE OF TECHNOLOGY & ENGINEERING


January - 2022
IV B. Tech I Sem Regular Examinations
Operations Research
Time: 3 hours Max. Mark-s: 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 What are the essential characteristics of operation research? L2 CO1 [1M]
b What is meant by slack variables? L2 CO2 [1M]
c What is the shadow prices in transportation problem? L1 CO2 [1M]
d Distinguish between assignment and allocation problem L2 CO3 [1M]
e Write the importance of Gantt chart in sequencing? L2 CO3 [1M]
1
f When do you recommend replacement of a machine with a new one? L1 CO3 [1M]
g Write the limitations of EOQ? L2 CO3 [1M]
h Write a short note on queuing model? L1 CO4 [1M]
i Write about strategy in game theory L1 CO4 [1M]
j What is meant by pert & cpm L2 CO5 [1M]
PART-B
 Consider the following problem:
                                                      Minimize Z=   4x1 +x2
                                                      Subject to    3x1 + 4X2 ≥ 2
a L3 CO1 [6M]
                                                                          -x1 – 5x2    ≤ -15
                                                                        x1, x2 ≥ 0
                                                Solve by the graphical method.
A firm can produce three types of cloth, say, A, B and C. Three kinds
of wool are required for it, say, red wool, green wool and blue wool.
2 One unit length of type A cloth needs 2 yards of red wool and 3 yards
of blue wool. One unit length of type B cloth needs 3 yards of red
wool, 2 yards of green wool and 2 yards of blue wool and one unit
b length of type C cloth needs 5 yards of green wool and 4 yards of blue L3 CO1 [6M]
wool. The firm has a stock of only 8 yards of red wool,10 yards of
green wool and 15 yards of blue wool. It is assumed that the income
obtained from one unit length of type A cloth is Rs.3, of type B cloth is
Rs.5 and that of type C cloth is Rs.4. Formulate the problem as Linear
Programming Problem.
OR
Use Big-M method to solve the following LPP
Maximize Z= 3x1-x2
3 a Subjected to 2x1+x2≥2 L3 CO1 [12M]
X1+3x2≤3,
X2≤4, x1,x2≥0
4 a Find the initial basic feasible solution of the following transportation L3 CO2 [6M]
problem by VAM.
Ware house
Factory Capacity
W1 W2 W3 W4
F1 19 30 50 10 7
F2 70 30 40 60 9
F3 40 8 70 20 18
Requirement 5 8 7 14
Solve the following assignment problem
I II III IV V
1 11 17 8 16 20
b 2 9 7 12 6 15 L3 CO2 [6M]
3 13 16 15 12 16
4 21 24 17 28 26
5 14 10 12 11 13
OR
A department has five employees with five jobs to be performed. The
time in hours) each man will take to perform each job is given in the
effectiveness matrix.

a L3 CO2 [6M]

How should the jobs be allocated one per employee so as to minimize the
total man- hours?
5 In a textile sales emporium, four salesmen A, B, C and D are available
to four counters W, X, Y and Z. Each salesman can handle any counter.
The service (in hours) of each counter when manned by each salesman
is given below:

b L3 CO2 [6M]

A company has to process five items on three machines A, B and C.


Processing times are given in the following table:

6 a L3 CO3 [12M]

Find the sequence that minimizes the total elapsed time.


OR
7 a Find the sequence for the following data so as to minimize the idle time L4 CO3 [6M]
in hours. What will be the earliest delivery time that B can be
promised?
Machines Job A Job B Job C Job D
I 5 6 8 4
II 4 7 9 10
A truck is priced for Rs. 60000 and running costs are estimated at
Rs.6000 for each of first 4 years increasing by Rs. 2000 per year in the
b L3 CO3 [6M]
fifth and subsequent years. If money is worth 10% when should the
truck be replaced. Assume scrap value = 0
a Write the operating characteristics of the queue system? L2 CO4 [6M]
8
b Mention the objectives of Inventory Management L3 CO4 [6M]
OR
A petrol pump station has two pumps the service times follow the
experimental distributions with a mean of 4min and the cars arrive in a
a L3 CO4 [6M]
9 poisson distribution at a rate of 10cars per hour. Find the probability
that a car has to wait. What proportion of time the pump remains idle?
b Derive the formula for EOQ L4 CO4 [6M]
UNIT-V
Reduce the following game by dominance property and solve it
1 2 3 4 5
1 I 1 3 2 7 4
a L3 CO5 [12M]
0 II 3 4 1 5 6
III 6 5 7 6 5
IV 2 0 6 3 1
OR
In a game of matching coins, player A wins Rs.2 if there are two heads,
wins nothing if there are two tails and loses Re1 when there are one
a L3 CO5 [7M]
head and one tail. Determine the payoff matrix, best strategies for each
player and the value of game to A.
1 Explain the following terms
1 a. optimistic time
b. Most likely time
b L4 CO5 [5M]
c. Pessimistic time
d. Expected time
e. Variance

You might also like