(Page 1 of 4)

USN 1 D A 21MET702

Seventh Semester B. E. Degree (Autonomous) Semester End Examination, SEE

OPERATIONS RESEARCH
MODEL QUESTION PAPER - 1
Maximum Time: 3 Hours Maximum Marks: 100

Instructions to candidates: (shall include instruction regarding issue of the Handbook/ charts/ tables etc)

(i) Answer FIVE FULL Questions.

(ii) Selecting one questions from each Unit
(iii) Use of normal distribution table is permitted.

UNIT - 1
1. a) Explain the meaning, scope and methodology of O.R. [08 Marks]

b) The ABC Company has been a producer of picture tubes to television sets and certain printed circuits for [12 Marks]
radio. The company has just expanded into full scale production and marketing of AM and AM-FM radio. It
has built a new plant that can operate 48 hours per week. Production of an AM radio in the new plant will
require 2 hours and production of an AM-FM radio will require 3 hours. Each AM radio will contribute Rs.
40/- to profits while an Am-FM radio will contribute Rs. 80/- to profits. The marketing department after
extensive research has determined that a maximum of 15 AM radios and 10 AM-FM radios can be sold each
week. Formulate a linear programming model to determine the optimum product mix of AM and AM-FM
radio that will maximize profits and solve the LP problem by graphical method

OR
2. a) What is Operations Research? Explain briefly the applications of OR? [12 Marks]
b) Solve the LP problem by graphical method [08 Marks]
Maximize Z = X + Y
Subject to the constraints:
X +Y < 1
-3X + Y > 3
X , Y > 0.
UNIT - 2
3. a) Explain unbalanced transportation problem with example [06 Marks]

b) Is x13=50, x14=20, x21=55, x31=30, x32=35, x34=25 an optimum solution of the following transportation [14 Marks]
problem?

To Available
units

6 1 9 3 70
From 11 5 2 8 55
10 12 4 7 90
Required units 85 35 50 45
If not, modify it to obtain a between feasible solution and obtain optimal solution by MODI method.

OR

4. a) Use North-West Corner Rule to obtain initial basic feasible solution, obtain an optimum basic feasible [08 Marks]
solution to the given below degenerate transportation problem.

D D D Available
1 2 3

Q 7 3 4 2
1
Q 2 1 3 3
2
Q 3 4 6 5
3
Required 4 1 5 10
b) A steel company has three open hearth furnaces and five rolling mills. Transportation costs (rupees per [12 Marks]
quintal) for shipping steel from furnaces to rolling mills are shown in the following table:

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
 (Page 2 of 4)
What is the optimal shipping schedule?
Mills

Capaciti
M M M M M es (in
1 2 3 4 5
quintals)
Furnaces F 4 2 3 2 6 8
1
F 5 4 5 2 1 12
2
F 6 5 4 7 1 14
3

Requirement
4 4 6 8 8
(in quintals)
UNIT - 3

5. a) A company has four territories open, and four salesmen available for assignment. The territories are not [12 Marks]
equally rich in their sales potential; it is estimated that a typical salesman operating in each territory would
bring in the following annual sales:

Territory I II III IV
Annual sales (Rs.) 60,000 50,000 40,000 30,000
Four salesmen are also considered to differ in their ability : it is estimated that, working under the same
conditions, their yearly-sales would be proportionately as follows

Salesman A B C D

Proportion 7 5 5 4

If the criterion is maximum expected total sales, then intuitive answer is to assign the best salesman to the
richest territory, the next best salesman to the second richest, and so on. Verify this answer by the
assignment technique.

An airline company has drawn up a flight schedule involving five flight routes. In order to assign these [08 Marks]
b) flight routes to its five pilots it has asked them to state their preferences by giving a score to each flight
out of 10. The higher the score the greater is the preference. Pilots may mark X if a certain flight route is
unacceptable to them. The following table gives the scores awarded by the pilots to the different routes

Flight Route
I II III IV V
A 8 2 X 5 4
B 10 9 2 8 4
PILOT

C 5 4 9 6 X
D 3 6 2 8 7
E 5 6 10 4 3

OR
6. a) A machine operator processes 5 jobs each week and must choose a sequence for them. The table gives the
changeover cost. Suggest the best sequence which minimizes the total change over cost.
A B C D E

A ∞ 2 5 7 1
B 6 ∞ 3 8 2
C 8 7 ∞ 4 7

D 12 4 6 ∞ 5
[08 Marks]
E 1 3 2 5 ∞

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
 (Page 3 of 4)
b) A pharmaceutical company is producing a single product and is selling it through five agencies situated
in three different cities. All of a sudden, there is a demand for the product in another five cities not having
an agency of the company. The company is faced with the problem of deciding on how to assign the [12 Marks]
existing agencies to dispatch the product to needy cities in such a way that the traveling distance is
minimized. The distance between the surplus and deficit cities (in km) is given in the following table:
The optimum assignment schedule is:

UNIT - 4
[10 Marks]
7. a) Define the following terms:
i) Event, ii) Activity, iii) Total Float, iv) Independent Float, v) Free Float.
[10 Marks]
b) A building project consists of 8 activities. Their estimated duration is given in the table..
Activitie A B C D E F G H
s:

Precedin - - A A C D B E,F,G
g
activity:

Time 3 4 5 6 7 8 9 3
(Weeks):

Draw the network and determine:

i) Earliest and latest event times and EST, EFT, LST and LFT of all activities.
ii) Determine critical path and project completion time.
iii). Find total float of all activities.
OR

8. a) Define the following. [06 Marks]

i) Optimistic time, ii) Pessimistic time, iii) Mostly likely time.
b) A project schedule has the following characteristic. [14 Marks]

TASK (1-2) (1-3) (1-4) (2-5) (2-6) (3-6) (4-7) (5-7) (6-7)

T 5 18 26 16 15 6 7 7 3
to
10 22 40 20 25 12 12 9 5
I
8 20 33 18 20 9 10 8 4
M
tp

Week
tm

Construct the Network diagram and find,

i) Expected task time and their variance.
ii) Critical path and its duration.
iii) Expected completion time.
iv) The probability completion of the project within 42 weeks.

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)
 (Page 4 of 4)

UNIT - 5

9. a) Describe i) Maxi-min and Mini-Max principle. [06 Marks]

ii) Saddle point.

b) Solve the game whose pay off matrix is given below. [14 Marks]

PLAYER B

B1 B2 B3 B4

PLAYER A A1 2 2 3 4

A2 4 3 2 2

OR

10. a) Solve the following 2 x 4 game graphically. [14 Marks]

Player B

B1 B2 B3 B4

PLAYER A A1 2 1 0 -2

A2 1 0 3 2

[06 Marks]
b) Explain dominance property

*******

Dr. Ambedkar Institute of Technology, Bangalore – 560056

(An Autonomous Institution Affiliated to Visvesvaraya Technological University, Belgaum)