GU1ARAT TECHNOLOGICAL UNIVERSITY

ATMIYA INSTITUTE OF TECHNOLOGY AND SCIENCE, RA1KOT

Sub: Operations Research
MARKS: 70
INSTRUCTIONS:
1. Attempt all the questions.
2. Figures to the right indicate Iull marks
3. Assume suitable additional data, iI required.
Q.1 (a) 1) Explain Iollowing terms: a. Basic Feasible Solution
b. Optimal Solution
c. Occupied cells and non- Occupied cells
d. Rim condition
e. Unbalanced Transportation Problem
I. Degenerate Solution
g. Non- Degenerate Solution
7
(b) I) What is OR? Explain the role oI OR in Decision Making process with its
applications.II) Determine an initial basic Ieasible solution to the Iollowing
transportation problem by using a NWCM method. (Ans 12200)
D1 D2 D3 D4 Supply
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Demand 200 225 275 250

4
3
Q.2 (a) Explain the Iollowing Terms:
a. Reneging
b. Jokeying
c. Transient State
d. Line length or Queue Size
7
e. Pure Birth process
1 (a/b/c) : (d/c)]
g (M/M/1) : (/SIRO)]
h. Pre-emptive Priority
(b) I) Write an Economic interpretation oI u
i
`s and v
j
`s.II) Five men are available
to do Iive diIIerent jobs. Find the assignment oI men to jobs that will
minimize the total time taken. (Ans 13 hours)
JOBS
I II III IV V
A 2 9 2 7 1
B 6 8 7 6 1
C 4 6 5 3 1
D 4 2 7 3 1
E 5 3 9 5 1

2
5
OR
(b) I) Determine an initial basic Ieasible solution to the Iollowing transportation
problem by using a LCM method. (Ans 180)
D1 D2 D3 D4 Supply
S1 1 2 1 4 30
S2 3 3 2 1 50
S3 4 2 5 9 20
Demand 20 40 30 10
II) A bakery keeps stock oI a popular brand oI cake. Previous experience
shows the daily demand pattern Ior the item with associated probabilities, as
given below:
Daily demand (number) Probability
010
20
30
40
50
0.010.20
0.15
0.50
0.12
0.02
Use Iollowing random numbers to simulate the demand Ior next 10 days.
3
4
O Random nos: 25 39 65 76 12 05 73 89 19 49
Also estimate the daily average demand Ior the cakes on the basis oI
simulated data.
Q.3 (a) The standard weight oI a special purpose brick is 5 kg and it contains two
basic ingredients B1 and B2. B1 costs Rs. 5 per kg and B2 costs Rs 8 per kg.
Strength considerations dictate that the brick should contain not more than 4
kg oI B1 and a minimum oI 2 kg oI B2. Since the demand Ior the product is
likely to be related to the price oI the brick, Iind out graphically the minimum
cost oI the brick satisIying the above conditions.(ans: Z 31 A(3,2) )
7
(b) Determine an initial basic Ieasible solution to the Iollowing transportation
problem by using a VAM method.
D1 D2 D3 D4 Supply
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Demand 5 8 7 14

7
OR
Q.3 (a) Formulate the given LP problem by applying simplex method.MAX Z
4x3y
Subject to constraints,
2xy1000
xy800
x400
y700 and
x, y ~0 (140)
7
(b) Determine an initial basic Ieasible solution to the Iollowing transportation
problem by using a MODI method. (Ans. 149, P no 340)
D1 D2 D3 D4 Supply
S1 6 3 5 4 22
S2 5 9 2 7 15
S3 5 7 8 6 8
Demand 7 12 17 9

7
Q-4 (a)
Activity Optimistic time Most likely time Pessimistic time
1-2 1 1 7
1-3 1 4 7
1-4 2 2 8
2-5 1 1 1
7
3-5 2 5 14
4-6 2 5 8
5-6 3 6 15
Draw network diagram and Iind out Iloats Ior all the activities.
Calculate the variance and standard deviation oI the project length. Find out
the probability oI completing the project at least 4 weeks earlier than expected
time. (P no 557)
(b) An engineering company is oIIered a material handling equipment A. It is
priced at Rs 60000 including cost oI installation and the costs Ior operation
and maintenance are estimated to be Rs 10000 Ior each oI the Iirst Iive years,
increasing every year by Rs 3000 in the sixth and subsequent years. The
company expects a return oI 10 percent on all its investment. What is the
optimal replacement period? ( p no 799)
7
OR
Q-4: (a) DeIine Simulation. Write the steps oI simulation process. Explain Monte
Carlo Simulation.
7
(b) We have Iive jobs each oI which must be processed on the 2 machines A and
B. in order AB. Processing times in hours are given in the table below: (p no
962)
JOB Machine A Machine B
12
3
4
5
51
9
3
10
26
7
8
4

7
Q-5 (a) Find an optimal sequence Ior the Iollowing sequencing problems oI Iour jobs
and Iive machines when passing is not allowed oI which processing time in
hours is given below:
JOB M1 M2 M3 M4 M5
AB
C
D
76
5
8
56
4
3
24
5
3
35
6
2
910
8
6
(P NO 969) ANS: 51 hrs
7
(b) II) Draw network diagram & Iind out the Critical Path by considering
Iollowing activity and duration.
Activity Predecessors Duration
A - 6
B A 4
4
3
C B 7
D A 2
E D 4
F E 10
G - 2
H G 10
I J,H 6
J - 13
K A 9
L C,K 3
M I,L 5
1) In a railway marshalling yard, goods trains arrive at a rate oI 30 trains per
day. Assuming that the inter arrival time Iollows an exponential distribution
and the service time distribution is also exponential with an average oI 36
minutes. Calculate
a) expected queue size (line length)
b) probability that the queue size exceeds 10
iI the input oI trains increases to an average oI 33 per day, what will be the
change in a) and b) ?
OR
Q-5 (a) 1) A manuIacturer has to supply his customer with 600 units oI his product
per year. Shortages are not allowed and the storage cost amounts to Rs 0.60
per unit per year. The set up cost per run is rs 80. Iind the optimum run size
and the minimum average yearly cost. (p no 623)II) Explain Iollowing
keywords:
O (s,Q) Policy
O (T,s,S) Policy
O Ordering cost
O Carrying cost
3
4
(b) I) Explain MINIMAX and MAXIMIN principles and Saddle point.II) Find out
the value oI game and optimal strategies Ior each player Irom Iollowing
payoII matrix.
Player A Player B
B1 B2 B3
A1A2
A3
-2-5
-5
15-6
20
-2-4
-8

4
3