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: 16IM5DCOPR Max Marks: 100
Date: 14.12.2017
Instructions: Answer any FIVE full questions choosing at least one from each unit.

UNIT 1
1. a) Define the term operations research and Mention its industrial applications. 04
b) Give the historical development of Operations Research. 04
c) A company produces two types of leather belts A and B. Profits on the two 12
types of belts are Rs.40 and Rs.30 per belt respectively. Each belt of type ‘A’
requires twice as much time as required by belt ‘B’. If all the belts were sold of
type B, the company could produce 1000 belts per day. The supply of leather is
sufficient only for 800 belts per day. Belt ‘A’ requires a fancy buckle and only
400 fancy buckles are available per day. For belt ‘B’ only 700 buckles are
available per day. Formulate the problem and solve it graphically.
OR
2. a) Explain the following terms with respect to a linear programming problem 08
i) Feasible solution ii) Infeasible solution
iii) Unbounded solution iv) Optimal Solution
b) Solve the following LPP using simplex method. 12
MinimizeZ  x1  3x2  2 x3

Subject to the constraints

3x1  x2  2 x3  7

2 x1  4 x2  12

 4 x1  3x2  8x3  10 and x1, x2, x3 ≥ 0

UNIT 2
3. a) List out any four differences between transportation and assignment problems. 04
b) What is degeneracy in a Transportation problem? How do you resolve it? 04
 c) Larsen and Toubro Construction Company needs 3, 3, 4 and 5 million cubic 12
feet of fill at four earthen dam sites I, II, III and IV in Karanataka. It can
transfer the fill from three mounds A, B and C where 2, 6 and 7 million cubic
feet of fill is available respectively. Costs of transporting one million cubic feet
of fill from mounds to the four sites in lakhs of rupees are given in the
following table.
To

I II III IV

A 15 10 17 18

B 16 13 12 13

From C 12 17 20 11

Determine the optimum transportation plan, which minimizes the total

transportation cost to the company.
OR
4. a) A batch of 4 jobs can be assigned to 5 different machines. The following table 10
gives the installation time in hours for each job on various machines. Find the
optimal assignment of jobs to machines and the total installation time.
Machine
M1 M2 M3 M4 M5
J1 10 11 4 2 8
Job J2 7 11 10 14 12
J3 5 6 9 12 14
J4 13 15 11 10 7
b) Solve the traveling salesman problem given by data, 10
C12 = 4, C13 = 7, C14 = 3, C23 = 6, C24 = 3 and C34 = 7, where
Cij = Cji and there is no route between cities i and j, if the value of Cij is not
given.

UNIT 3
5. a) Define the term Queue. Explain the queuing system and their characteristics. 10

b) A television service person finds that the time spent on his jobs is an 10
exponential distribution with a mean of 30 minutes. If the repair sets in the
order in which they come in and the arrivals of sets follow a Poisson
distribution approximately with an average rate of 10 per 8 hours a day. What
is the service person’s expected idle time each day? How many jobs are ahead
of the average sets just brought in?
 UNIT 4
6. a) What is meant by crashing of a project? Explain it in brief. 05
b) The following table shows the jobs of a network along with their time 15
estimation in days.
Job 1 – 2 1 – 3 1 – 4 2 – 5 3 – 5 4 – 6 5 – 6

to 1 1 2 1 2 2 3

tm 1 4 2 1 5 5 6

tp 7 7 8 1 14 8 15

i. Draw the project network

ii. Identify the critical path and duration
iii. Calculate the variance and standard deviation of the project
iv. What is the probability of completion of the project
a. 4 days earlier than expected
b. Not more than 4 days later than expected

UNIT 5
7. a) Explain the following in relevance to theory of games. 10

i. Pay off matrix ii. Saddle point iii. Pure strategy

iv. Mixed strategy v. Value of a game

b) Solve the following 2  3 game by graphical method 10

B

I II III

A I 1 3 11

II 8 5 2

*******