You are on page 1of 4

U.S.N.

BMS College of Engineering, Bangalore-560019


(Autonomous Institute, Affiliated to VTU, Belgaum)
January 2015 Semester End Make Up Examinations
Course: OPERATION RESEARCH Duration 3hrs
Course Code:11ME7IEOPR Max Marks: 100
Date: 27.01.2015

Instructions:. 1. Answer FIVE Full questions choosing one from each unit.
2. Unit 3, 4 and 5 Compulsory.
3. Use of statistical tables is permitted

UNIT 1
1. a) Define OR. What are the tools and techniques used in solving the OR problems. 08
Explain
b) Old hens can be bought at Rs.2 each and young ones at Rs5 each. The old hens lay 3 12
eggs per week and the young ones lay 5 eggs per week. Each egg being worth 30
paise. A hen young or old cost Rs.1 per week to feed. Only Rs 80 is available to
spend for hens. How much of each kind should be purchased to give a profit of more
than Rs 6 per week, assuming that the former cannot house more than 20 hens.
Formulate as an LPP and solve by graphical method.

OR
2. a) Solve the following LPP by simplex method 10
Min z= x1-3x2+3x3
Subjected to
3x1-x2+3x3≤7
-2x1+4x2≤12
-4x1+3x2+8x3≤10
x1,x2,and x3≥0
b) Solve by Big M method 10
Max Z = -2x1-x2 subjected to
3x1+x2=3
4x1+x2≥6
x1+2x2≤4
x1,x2≥0

UNIT 2
3. a) A product is manufactured by four factories A, B, C and D. The unit production 20
cost in them are Rs.2/-, Rs.3/-, Rs.1/- and Rs.5/- respectively. Their Production
capacities are 50,70, 30 and 50 units respectively. These factories supply the
product to four stores demand of which are 25, 35, 105 and 25 units respectively.
Unit transportation cost in rupees from each factory to each store is given in the
table below:
Store
1 2 3 4
A 2 4 6 11
Factory B 10 8 7 5
C 13 3 9 12
D 4 6 8 3
Determine the extent of deliveries from each of the factory to each of the store so
that the total production and transportation cost is minimum.

OR
4. a) Solve the following assignment of salesman to various Warehouses which will yield 10
Maximum Profit. The matrix entries are profit / day in rupees.

Ware House
1 2 3 4
A 5 40 20 5
Salesman B 25 35 30 25
C 15 25 20 10
D 15 5 30 15
b) Solve the Travelling salesman problem with the following cost matrix. 10

1 2 3 4 5
1 ∞ 7 6 8 4
2 7 ∞ 8 5 6
3 6 8 ∞ 9 7
4 8 5 9 ∞ 8
5 4 6 7 8 ∞

UNIT 3
5. a) Consider the following data for activities in a given project. 12
Activity A B C D E F G H

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


Activity
Duration 10 15 5 10 6 12 12 10
(Days)
i) Draw the network of the project
ii) Identify the critical path and project duration
iii) Total float for each activity.
b) The following table lists the jobs of a network with their time estimates. 08
Jobs Duration in days
i-j to tm tp
1-2 3 6 15
1-6 2 5 14
2-3 6 12 30
2-4 2 5 8
3-5 5 11 17
4-5 3 6 15
6-7 3 9 27
5-8 1 4 7
7-8 4 19 28
Determine the probability that the jobs on critical path will be completed within a
due date of 41 days.

UNIT 4
6. a) The men’s department of a large store employs one tailor for customer fittings. The 10
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 the fitting room?
iii) What percentage of time is the tailor idle?

b) Players A and B play a game in which each player has three has three coins 20p, 25p 10
and 50p. Each of them selects a coin without the knowledge of the other player. If
the sum of the values of the coins is an even number, A wins B’s coin. If the sum is
an odd number, B wins A’s coin.
(i) Develop a payoff matrix with respect to player A.
(ii) Find the optimal strategies for the players. What is the value of the
game?

UNIT 5
7. a) What are the principal assumptions made while dealing with sequencing problems? 06
b) Find the sequence that minimizes the total time required in performing the following
jobs on three machines in the order A, C, B. Also find the total elapsed time.
Job

1 2 3 4 5 6 7

14
A 12 6 5 11 5 7 6

Machine B 7 8 9 4 7 8 3

C 3 4 1 5 2 3 4
*******

You might also like