Operations Research Assignment

Q1. An advertising agency is preparing an advertising campaign for a group of agencies. These agencies
have decided that their target customers should have the following characteristics with importance
(weight age) as given below:

Age
Annual Income
Female

Characteristics
25-45 years
Above Rs. 80,000
Married

Weightage
20
40
40

The agency has made a careful analysis of three media and has compiled the following data:
Data Item
Media
Audience Size (000)
800
1,000
1,500
Cost per advertisement 10,000
30,000
1,00,000
(Rs)
Min. No. of
15
10
10
advertisement allowed
Max No. of
25
15
15
advertisement allowed
Reader Characteristics
i) Age 25-45 years
70%
60%
50%
ii) Annual
income 60%
50%
40%
above Rs. 80,000
iii) Females Married
45%
50%
40%
The advertising agency ha earmarked a budget of Rs. 10, 00,000 for this purpose. Formulate the LPP
model for the problem to maximize the total expected effective exposure.
Q2. An air force is experimenting with three types of bombs P, Q, R in which three kinds of explosive A, B
& C will be used. Taking the various factors into account, it has been decided to use the max. 600 kg of
explosive A, at least 480 kg of explosive B & exactly 540 kg of explosive C. Bomb P requires 3, 2, 2 kg,
bomb Q requires 1, 4, 3 kg & bomb R requires 4, 2, 3 kg of explosive A, B & C respectively. Bomb P is
estimated to give the equivalent of a 2 ton explosion, bomb Q, a 3 ton of explosion and bomb R, a 4 ton
of explosion respectively. Under what production schedule can the air force make the biggest bang?

Q3.

A company wishes to determine an investment strategy for each of the next four years . Five
investment types have been selected, investment capital has been allocated for each of the
coming four years, and maximum investment levels have been established for each investment
type. An assumption is that amounts invested in any year will remain invested until the end of the
planning horizon of four years. The values in the body of the table represent net return on

investment one rupee up to the end of the planning horizon. For example, a Rupee
invested in investment type B at the beginning of year 1 will grow to Rs. 1.90 by the end
of the fourth year, yielding a net return of Rs. 0.90.

Investment made
at the beginning

Investment Type
A

Rupees
E

available
(in 000s)

of year
NET

RETURN

DATA

0.80

0.90

0.60

0.75

1.00

500

0.55

0.65

0.40

0.60

0.50

600

0.30

0.25

0.30

0.50

0.20

750

0.15

0.12

0.25

0.35

0.10

800

Investment (in 000s) 750

600

500

800

1,000

Maximum Rupee

Solve the above transportation problem and get an optimal solution.

Q4. A company has four warehouses and six stores. The warehouses altogether have a surplus of 22
units of a given commodity, divided among them as follows:
Warehouses
1
2
3
4
Surplus
5
6
2
9
The six stores altogether need 22 units of the commodity. Individual requirements at stores
1,2,3,4,5,6 are 4,4,6,2,4 and 2 units respectively. Cost of shipping one unit of commodity from
warehouse I to store j in rupees is given in the matrix below.

1
1
2
3
4
i)
ii)

9
12
9
6
9
10
7
3
7
7
5
5
6
5
9
11
3
11
6
8
11
2
2
10
Formulate the mathematical model for the problem.
How should the products be shipped from the warehouses to the stores so that the
transportation cost is minimum?

Q5. A company has one surplus truck in each of the cities A, B, C, D and E and one defict truck in
each of the cities 1, 2,3,4,5 and 6. The Distance between the cities in kilometers is shown in the
matrix below. Find the assignment of trucks from cities in surplus to cities in deficit so that the
total distance covered by vehicles is minimum.
1
12
10
11
6
8

A
B
C
D
E

Q6.

2
10
18
10
14
12

3
15
25
3
10
11

4
22
15
8
13
7

5
18
16
5
13
13

6
8
12
9
12
10

A machine operator has to perform three operations turning, threading and knurling on
a number of different jobs. The time required to perform these operations (in minutes)
for each job is known. Determine the order in which the jobs should be processed in
order to minimize the total time required to turn out all the jobs. Also find the idle times
for the three operations.
Job
1.
2.
3.
4.
5.
6.

Time for Turning

(Minutes)
3
12
5
2
9
11

Time for Threading

(Minutes)
8
6
4
6
3
1

Time for Knurling

(Minutes)
13
14
9
12
8
13

Philips India is engaged in manufacturing different types of equipments

for various consumers. The company has two assembly lines to produce its
product. The processing time for each of the assembly lines is regarded as a
random variable and is described by the following distributions:
Q7.

Processing Time
(in min.)
40
42
44
46
48

Assembly X

Assembly Y

.10
.15
.40
.10
.25

.20
.40
.20
.15
.05

Using the following random numbers, generate data on the processing times
for 10units of the product and compute the expected processing time for
the product:
4236,7573,4943,1283,2014,3604,9344,5316,7606,0086
For the purpose, read the numbers horizontally, taking the first two digits
for the processing time on Assembly X and the last two digits for processing
time on Assembly Y.
Q8. Estimated times for the jobs of a project are given below:
Job
A
Time
13
(in
weeks)

B
5

C
8

D
10

E
9

F
7

G
7

H
12

I
8

J
9

K
4

L
17

The constraints governing the jobs are as follows:

A and B are start jobs; A controls C, D and E; B controls F nad J; G depends
on C; H depends on D; E anf F control I and L; K follows J; L is also controlled
by K; G,H,I and L are the last jobs. Draw the network, determine float for
each activity, project duration and the critical path.

Time Between arrivals

(minutes)

Frequency

Service Time (in

minutes)

Frequency

1
2
3
4
5
6

5
20
35
25
10
5

1
2
3
4
5
6

1
2
4
2
1
0

The store starts work at 11.00 am and closes at 12.00 noon for lunch
and the customers are served on the first came first served basis.
Using Monte Carlo simulation technique, find average length of
waiting line, average waiting time, average service time and total time spent
by a customer in system.
You are given the following set of random numbers, first twenty for
arrivals and last twenty for service:
64

04

02

70

03

60

16

18

36

38

07

08

59

53

01

62

36

27

97

86

30

75

38

24

57

09

12

18

65

25

11

79

61

77

10

16

55

52

59

63