U.S.N.

BMS College of Engineering, Bangalore-560019

(Autonomous Institute, Affiliated to VTU, Belgaum)
December 2015 Semester End Main Examinations
Course: Operation Research Duration: 3 hrs
Course Code:11ME7IEOPR Max Marks: 100

Date: 14.12.2015
Instructions: Answer Five Full questions choosing one from each Unit.

UNIT 1

1. a) What are the essential characteristics of OR? Mention different phases in an OR 08

study.
b) An oil company has 2 units A and B which produce 3 different grades of oil, 12
superfine, medium and low grade oil. The company has to supply 12, 8 and 24
barrels of superfine, medium and low grade oils respectively per week. It costs the
company Rs 1000and Rs 800 per day to run the units A and B respectively. On a
day unit A produces6, 2,4 barrels and the unit B produces 2,2 and 12 barrels of
superfine, medium and low grade oil per day. The manager has to decide on how
many days per week should each unit be operated in order to meet the requirement
at minimum cost. Formulate the LPP and solve it graphically.
OR

2. a) What do you mean by degeneracy connected to simplex problem? How do you 06

overcome the degeneracy problem?
b) Show that there is an unbounded solution to the following LPP, 14
Max Z =4x1+x2+3x3+5x4 ,
STC 4x1-6x2-5x3-4x4 ≥-20,
-3x1-2x2+4x3+ x4 ≤10,
-8x1-3x2+3x3+2x4 ≤20,
x1, x2, x3, x4 ≥0

UNIT 2

3. a) Obtain the optimal solution for the following transportation problem. 14

Agencies
1 2 3 4 Capacity
1 8 10 7 6 50
Factories 2 12 9 4 7 40
3 9 11 10 8 30
Demand 25 32 40 23
b) Explain the term degeneracy in transportation problems. 06
 OR
4. a) The owner of a small machine shop has Four machines available to assign job for 10
the day. Five jobs are offered with expected profit for each machine on each job
which are as follows.
Jobs
A B C D E
1 62 78 50 111 82
Machines 2 71 84 61 73 59
3 87 92 111 71 81
4 48 64 87 77 80
Find the assignment of machine to the jobs that will result in a maximum profit.

b) Find the least cost route for the following travelling salesman problem. 10

To
A B C D E
A - 7 5 3 5
B 7 - 8 4 3
From C 5 8 - 6 2
D 3 4 6 - 2
E 5 3 2 2 -
UNIT 3
5. a) Define the following terms with reference to CPM /PERT 06
i)Total float
ii) Free Float
iii) Independent float.
b) Table below gives the normal duration and cost, crash duration and cost. Determine 14
the optimum duration and cost. Indirect cost is Rs. 1000/week.

Activity Normal Crash

Duration cost Duration cost
(Days) (Days)

1-2 8 7000 3 10000

1-3 4 6000 2 8000
2-3 0 0 0 0
2-5 6 9000 1 11500
3-4 7 2500 5 3000
4-6 12 10000 8 16000
5-6 15 12000 10 16000
5-7 7 12000 6 14000
6-8 5 10000 5 10000
7-8 14 6000 7 7400
7-9 8 6000 5 12000
8-9 6 6000 4 7800
 UNIT 4
6. a) 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?

b) A self-service store employs one cashier at its counter. Nine customers arrive on an 10
average every 5 minutes while the cashier can serve 10 customers in 5 minutes.
Assuming Poisson distribution for arrival and exponential distribution for service
time, find
(i) What is the average number of customers in the system?
(ii) How much time a customer is expected to spend in the system
(iii) Average time a customer waits before being served?
(iv) Average queue length

UNIT 5
7. a) Six jobs have to be processed on machines M1, M2 and M3 in the order M1, M2, M3. 10
Time taken by each job on these machines is given below in Table 6. Determine the
sequence so as to minimize the processing time and find idle time on each machine.

Table 6

Job M1 M2 M3
1 8 3 8
2 3 4 7
3 7 5 6
4 2 2 9
5 5 1 10
6 1 6 9
b) The operations of two jobs 1 and 2 on 5 machines M1, M2 M3, M4 and M5 is given in 10
the following Table 7. Find out the optimum sequence in which the jobs should be
processed so that the total time used is minimum. The technological order of use of
machine for job 1 is M1, M2 M3, M4 and M5 and for job 2 is M3, M1 M4, M5 and M2.
Table 7
Job M1 M2 M3 M4 M5
1
1 2 3 5 1
Job M3 M1 M4 M5 M2
2
3 4 2 1 5

*******