Total No. of Questions : 8] SEAT No.

8
23
PA-2643 [Total No. of Pages : 6

ic-
[5927]-424

tat
7s
B.E. (Mechanical)

7:5
02 91
OPERATIONS RESEARCH

3:4
0
(2019 Pattern) (Semester - VII) (Elective - IV) (402045-D)

31
0/0 13
0
1/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates:

E

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

81

8
C

23
2) Answers in one answer books.

ic-
3) Figures to the right indicate full marks.
16

tat
4) Assume suitable data, if necessary.
8.2

7s
.24

7:5
91
Q1) a) Use Graphical method to solve the following LPP [10]
49

3:4
30
31

Minimize Z = 10 X1 + 4 X2
01
02

Subject to Constraints
1/2
GP
0/0

3X1 + 2X2  60
CE
81

8
23
7X1 + 2X2  84
.23

ic-
16

3X1 + 6X2  72
tat
8.2

7s

X1, X2  0
.24

7:5
91
49

3:4

b) Write the generalised syntax of LPP and discuss the following terms
30
31

related to LPP [7]

01
02

i) Objective function.
1/2
GP
0/0

ii) Constraint surface.

CE
81

iii) Feasible and infeasible points.

.23
16

iv) Optimum solution.

8.2

OR
.24
49

P.T.O.
Q2) a) Use Simplex method to solve the following LPP [10]

8
23
Maximize Z = 80 X1 + 55 X2

ic-
tat
Subject to Constraints

7s
7:5
4X1 + 2X2  40

02 91
3:4
2X1 + 4X2  32

0
31
0/0 13
X1, X2  0
0
1/2
.23 GP

b) i) Limitations of graphical method. [3]

E
81

8
ii) Explain with the help of example conversion of Primal to Dual
C

23
LPP problem. [4]

ic-
16

tat
8.2

7s
.24

7:5
Q3) a) Discuss with the help of flow chart Hungarian method to solve the
91
49

assignment problems. [8]

3:4
30
31

b) Find out the initial feasible solution by Vogel’s Approximation Method

01
02

(VAM). [10]
1/2
GP

W1 W2 W3 W4 Availability
0/0
CE
81

8
F1 19 30 50 10 7

23
.23

F2 70 30 40 60 9
ic-
16

tat
8.2

7s

F3 40 8 70 20 18
.24

7:5
91

Requirement 5 8 7 14
49

3:4
30
31

OR
01
02
1/2

Q4) a) An airline company has drawn up a new flight schedule that involves
GP
0/0

five flights. To assist in allocating five pilot to the five flights, it has
CE

asked them to state their preference scores by giving each flight a number
81

out of 10. The higher the number, the greater is the preference. A few of
.23

these flights are unsuitable to some pilots, owing to domestic reasons.

16

These have been marked wit “X’’.

8.2
.24
49

[5927]-424 2
 Flight Number

8
23
I II III IV V

ic-
tat
7s
A 8 2 X 5 4

7:5
Pilot B 10 9 2 8 4

02 91
3:4
C 5 4 9 6 X

0
31
0/0 13 D 3 6 2 8 7
0
1/2 E 5 6 10 4 3
.23 GP
E

What should be the allocation of the pilots in order to meet maximum

81

8
C

23
preference? [12]

ic-
16

tat
b) Explain the generalised syntax of assignment and transportation problem.
8.2

7s
[6]
.24

7:5
91
49

3:4
30
31

Q5) a) A small project involves 7 activities and their times estimates are listed
in the following table. Activities are identified by their beginning (i) and
01
02

ending (j) node numbers. [12]

1/2
GP
0/0

Activities Estimated Duration (Weeks)

CE
81

8
23
(i-j)
.23

Optimistic Most likely Pessimistic

ic-
16

tat
8.2

7s

1-2 1 1 7
.24

7:5
91

1-3 1 4 7
49

3:4
30
31

1-4 2 2 8
01
02
1/2

2-5 1 1 1
GP
0/0
CE

3-5 2 5 14
81
.23

4-6 2 5 8
16
8.2

5-6 3 6 15
.24
49

[5927]-424 3
 i) Draw the network diagram of the activities in the projects.

8
23
ic-
ii) Find expected duration and variance for each activity. What is the

tat
expected project length?

7s
7:5
02 91
iii) Calculate the variance and standard deviation of the project length.

3:4
What is the probability that the project will be completed :

0
31
0/0 13
1) At least 4 weeks earlier than expected time.
0
1/2
.23 GP

2) No more than 4 weeks later than expected time.

E
81

8
C

23
Given

ic-
16

tat
Z (0-Z) 1.33
8.2

7s
.24

7:5
Probability 0.4082
91
49

3:4
30

b) Explain with example what is looping and Dangling errors in the network.
31

[6]
01
02
1/2
GP

OR
0/0
CE

Q6) a) A taxi owner estimates from his past records that the costs per year for
81

8
23
operating a taxi whose purchase price when new is Rs. 60,000 are as
.23

ic-
given below :
16

tat
8.2

7s

Year 1 2 3 4 5
.24

7:5
91

Operating Cost (Rs) 10,000 12,000 15,000 18,000 20,000

49

3:4
30
31

After 5 years, the operating cost is Rs. 6000 *K where K = 6, 7, 8, 9

01
02

and 10 (K denotes the age of in years) If the resale value decreases by

1/2

10% of purchase price each year, what is the best replacement policy?
GP
0/0

Cost on money is zero. [12]

CE
81
.23

b) Explain different types of floats involved in the in CPM analysis of

16

network and how it is calculated during the analysis. [6]

8.2
.24
49

[5927]-424 4
Q7) a) A dentist scheduled all his patients for 30 minute appointments. Some

8
23
of the patients take more or less than 30 minutes depending on the type

ic-
of dental work to be done. The following summary shows the various

tat
categories of work, their probability and time actually needed to complete

7s
the work :

7:5
02 91
Category of service Time required in Minute Probability

3:4
0
Filling 45 0.40

31
0/0 13
Crown 60 0.15
0
1/2
.23 GP

Cleaning 15 0.15
E
81

8
Extraction 45 0.10
C

23
ic-
Check tip 15 0.20
16

tat
8.2

7s
Simulate the dentist’s clinic for four hours and determine the average
.24

7:5
waiting time for the patients as well as the idleness of the doctor. Assume
91
49

that all the patients show up at the clinic at exactly their scheduled
3:4
30

arrival time starting at 8 : 00 a.m. Use the following sequence of random

31

numbers to stimulate the above problem.

01
02

Random Numbers : 40, 82, 11, 34, 25, 66, 17, 79. [12]
1/2
GP

b) Write short note on Monto Carlo Simulation. [5]

0/0

OR
CE
81

8
Q8) a) A salesman located in a city A decided to travel to city B. He knew the

23
.23

distances of alternative routes from city A to city B. He then drew a

ic-
16

highway network map as shown in following figure. The city of origin

tat
8.2

A. is city 1. The destination city B is city 10. Other cities through which
7s

the salesman will have to pass through are numbered 2 to 9. The arrow
.24

7:5
91

representing routes between cities and distances in kilometres are located

49

3:4

on each route. The salesman problem is to find the shortest route that
30
31

covers all the selected cities from A to B. The time for each activity is
01
02

given in the table. (Solve by using Dynamic programming) [12]

1/2
GP
0/0
CE
81
.23
16
8.2
.24
49

[5927]-424 5
 8
23
Activity Duration Activity Duration

ic-
tat
1-2 4 4-5 6

7s
7:5
1-3 6 4-6 10

02 91
3:4
1-4 3 4-7 5

0
31
2-5 0/0 13 7 5-8 4
0
1/2
.23 GP

2-6 10 5-9 8

2-7 5 6-8 3
E
81

8
C

23
3-5 3 6-9 7

ic-
16

tat
3-6 8 7-8 8
8.2

7s
.24

3-7 4 7-9 4
7:5
91
49

3:4
8-10 7
30
31

9-10 9
01
02
1/2
GP
0/0

b) Explain in brief various steps involved in the simulation. [5]

CE
81

8
23
.23

 ic-
16

tat
8.2

7s
.24

7:5
91
49

3:4
30
31
01
02
1/2
GP
0/0
CE
81
.23
16
8.2
.24
49

[5927]-424 6