U.S.N.

BMS College of Engineering, Bengaluru-560019

Autonomous Institute Affiliated to VTU

December 2017 Semester End Main Examinations

Course: Operations Research Duration: 3 hrs
Course Code: 16ME7IEOPR Max Marks: 100
Date: 22.12.2017

Instructions: i. Answer one full question from each unit, use of statistical tables is permitted.
ii. Use of Probability table permitted.

UNIT 1
1 a) Explain the various phases of OR. 06
b) What are the limitations of linear programming technique? 04
c) A small plant makes two types of automobile parts, part A and part B. It buys 10
castings that are to be machined bored and polished. The following data is available.

Capacity Part A Part B

Machining capacity 25/hr 40/hr
Boring capacity 28/hr 35/hr
Polishing capacity 35/hr 25/hr

Castings for part A cost Rs.20/- each and for part B they cost Rs.30/- each. Finished
products sell at Rs.50/- and Rs.60/- respectively. The three machines have running
costs of Rs.200/-, Rs.140/- and Rs.175/- per hour. Assuming that any combination of
part A and part B can be sold, formulate the problem as an LPP and solve
graphically.
OR
2 a) Explain the following special cases of LPP graphically. 10
i) No feasible solution
ii) Unbounded solution

b) Solve the following LPP using Big M method. 10

Maximize, Z = 3x1 + 2x2

Subject to, 2x1 + x2 ≤ 1
3x1 + 4x2 ≥ 4
x1, x2 ≥ 0
UNIT 2
3 a) What is degeneracy in transportation? How it can be resolved? 06
b) Consider the problem of transporting a product from three sources to four 14
destinations. The distance between sources and destinations as well as the supply
and demand units are given in the following table. The transportation cost is
proportional to distance. Find the optimum transportation schedule for the product.
Find the basic feasible solution by North West Corner Method.
 To
D1 D2 D3 D4 Capacity
From
O1 5 10 15 9 15

O2 5 15 7 8 30

O3 10 7 6 4 30

75
Requirement 10 20 15 30
75
UNIT 3
4 a) Write the mathematical model of Assignment problem. 04
b) Solve the following assignment problem (cost matrix). 16
Machines
A B C D E

1 11 7 10 17 10
2 13 21 7 11 13
Jobs 3 13 13 15 13 14
4 18 10 13 16 14
5 12 8 16 19 10

OR
5 a) Explain Fulkerson’s rule of numbering the events of project network with example. 04

b) The following table gives a list of jobs along with time estimates. 16

Activity Time estimates

in days
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
i) Draw the network diagram.
ii) Identify the critical path.
iii) What is the probability of completing the project in 38 days?
iv) What due date has 90% chance of being met?
 UNIT 4
6 a) A small project consists of the jobs as shown in the following table. Their normal 20
time and cost and crash time and cost are also given.

Normal Crash
Jobs Time in Cost in Time in Cost in
days Rs. days Rs.
1-2 1 25 1 25
2-3 3 80 2 140
1-3 5 125 3 225
3-4 3 100 2 175
4-5 1 30 1 30

Indirect cost is Rs.75/day.

i) Determine the normal duration and the corresponding cost.
ii) Determine the optimum duration and the corresponding cost.
iii) Determine the shortest duration and the corresponding cost.

UNIT 5
7 a) Explain clearly the following terms: 10
i) Pay off matrix
ii) Saddle point
iii) Two person zero sum game
iv) Strategy
v) Mixed strategy
b) There are two competing departmental stores R and S in a city. Both the stores have 10
equal reputation and the number of customers are equally distributed between the
two. Both the stores plan to run annual discount sales in the last week of December.
They want to attract more number of customers by advertising through newspaper,
radio and television. By seeing the market trend, the store R constructed the
following payoff matrix, where the numbers in the matrix represent gain or loss of
customers. Find the optimal strategies for stores R and S.

Stores ‘S’
NP R TV
NP 40 50 -70
Stores ‘R’ R 10 25 -10
TV 100 30 60

*******