U.S.N.

BMS College of Engineering, Bangalore-560019

(Autonomous Institute, Affiliated to VTU, Belgaum)

January 2017 Semester End Make Up Examinations

Course: OPERATIONS RESEARCH Duration: 3 hrs
Course Code: 16IE5DCOPR Max Marks: 100
Date: 12.01.2017

Instructions: Answer any Five full questions choosing one from each unit.
UNIT 1
1. a. Briefly explain the phases of OR. 09

b. A manufacturer of a line of patent medicines is preparing a production plan on 11

medicines A and B. There are sufficient ingredients available to make 20,000 bottles
of A and 40,000 bottles of B, but there are only 45,000 bottles into which either of
the medicines can be put. Furthermore, it takes 3 hours to prepare enough material
to fill 1000 bottles of A and it takes 1 hour to prepare enough material to fill 1000
bottles of B and there are 66 hours available for this operation. The profit is Rs. 8
per bottle of A and Rs.7 per bottle of B. (i) Formulate this problem as an L.P.P to
maximize the profit. (ii) Solve it graphically

OR
2. a. Solve the following LP problem by simplex method. 14
Maximize Z = 3x1+2x2
Subject to x1+x2 ≤ 40
x1-x2≤ 20
x1, x2 ≥0

b. Explain feasible, basic feasible and optimal solution. 06

 UNIT 2
3. a. A company operates 3 coal mines A, B, C which provides coal to 5 customers C1, 14
C2, C3, C4, and C5 respectively per week. Transportation cost in rupees per tonne
from each mine to each customer is given below. Find the weekly transaction
schedule which minimizes the total transportation cost.

Customers supply

C1 C2 C3 C4 C5

A 4 16 1 16 14 400

Plants B 18 10 8 12 12 500

C 6 1 4 13 2 700

Demand 500 400 300 300 600

b. Differentiate between Transportation, Assignment and travelling salesman problem 06

OR
4. a. A company has 5 tasks and 5 persons to perform the same. The matrix shows the 10
returns (profit) in hundreds of rupees for assigning jobs to the persons. Assign the 5
tasks to 5 persons to maximize the total return

Person

A B C D E

J1 5 11 10 12 4

T J2 2 4 6 3 5
a
J3 3 12 5 14 6
S
J4 6 14 4 11 7
k
J5 7 9 8 12 5
 b. A salesman has to visit five cities A, B, C, D and E. The distance (in hundred KM) 10
between the five cities is as follows.

To

A B C D E

A - 7 6 8 4

B 7 - 8 5 6

From C 6 8 - 9 7

D 8 5 9 - 8

E 4 6 7 8 -

If the salesman starts from the city A and has to come back to city A, which route
should he select so that the total distance travelled is minimum?

UNIT 3
5. a. The men’s department of a large store employs one tailor for customer fittings. The 09
number of customers requiring fittings appears to follow a Poisson distribution with
mean arrival rate of 24 per hour. Customers are fitted on first come, first serve basis
and they are always willing to wait for the tailor’s service. The time it takes to fit a
customer appears to be exponentially distributed with a mean of 2 minutes.

(i)What is the average number of customers in the fitting room?

(ii)How much time a customer is expected to spend in fitting room?
(iii)What percentage of time is the tailor idle

b. Define Queue. List and explain the characteristics of queuing system 11

UNIT 4
6. a. Define float. Explain its different types and their importance.
06
 b. Activity precedence diagram for a project is shown below.
14
Activity A B C D E F G H

Preceeding - - B A,B A,B C,D E,F C,D

Activity

Duration 10 15 5 10 6 12 12 10

(Days)

i) Construct the network of the project

ii) Identify the critical path and determine the project duration
iii) Calculate EST, EFT, LST, LFT, TF, IF and FF for each activity.

UNIT 5
7. a. Explain Minimax and Maxmini principle. Distinguish between pure strategy and 06
mixed strategy.

b. Use the concept of dominance to solve the following game. 08

I II III IV

1 20 15 12 35

A 2 25 14 8 10

3 40 2 19 5

4 5 4 11 0

c. Solve the following game graphically. 06

B
I II III IV
A I 2 2 3 -1
II 4 3 2 6

*******