Total No. of Questions : 8] SEAT No.

8
23
PB2371 [Total No. of Pages : 5

ic -
[6263]-221

ta t
B.E. (Mechanical)

4s
OPERATION RESEARCH

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

4:0
0
41
Time : 2½ Hours] 2/0 13 [Max. Marks : 70
Instructions to the candidates:
0
5/2
.23 GP

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

2) Answers in one answer books.
E

3) Figures to the right indicate full marks.

82

8
C

23
4) Assume suitable data, if necessary.

ic-
16

t
sta
Q1) a) Use simplex method to solve the following LPP. [10]
8.2

:34
Maximize Z = 2x1 + x2
.24

91
:00
49

Subject to constraints
14
30

4x1 + 3x2 < 12;

24
01

4x1 + x2 < 8;
/20
GP
/05

4x1 – x2 < 8;
2
CE

x1, x2 > 0;
82

8
23
b) Discuss the following terms related to LPP. [7]
.23

ic-
16

i) Objective function
tat
8.2

4s

ii) Constraint surface

.24

0:3
91

iii) Feasible and infeasible points

49

4:0

iv) Optimum solution

30
41

OR
01
02
5/2

Q2) a) One kind of cake requires 200g of flour and 25g of fat, and another kind
GP

of cake requires 100g of flour and 50g of fat. Find the maximum number
2/0

of cakes that can be made from 5 kg of flour and 1 kg of fat assuming

CE
82

that there is no shortage of the other ingredients, used in making the

.23

cakes. Formulate LPP and Use Graphical method to solve. [10]

16

b) Explain the limitation of LPP in solving Engineering problem. How this is

8.2

used for the optimization. [7]

.24
49

P.T.O.
Q3) a) Discuss the following related to the transportation model. [8]

8
23
i) Feasible solution

ic -
ta t
ii) Optimum solution

4s
iii) Non-degenerate basic feasible solution

0:3
02 91
iv) Degenerate basic feasible solution

4:0
0
41
b) Find out the initial feasible solution by Vogel’s Approximation Method
2/0 13
(VAM). [10]
0
5/2
.23 GP

Stores Availability
E

I II III IV
82

8
C

23
A 21 16 15 13 11

ic-
16

t
sta
Warehouse B 17 18 14 23 13
8.2

:34
C 32 27 18 41 19
.24

91
:00
49

Requirement 6 10 12 15
14
30
24
01

OR
/20
GP
/05

Q4) a) In a construction site there are four cranes. Each crane must be allocated
2
CE
82

8
to one job. The time required to set up each crane for each job is shown

23
in table. Find the best assignment of cranes to the jobs, so that the total
.23

time required for completing the job is minimized. [12] ic-

16

tat
8.2

4s

Job
.24

0:3

I II III IV
91
49

4:0
30

Crane A 5 7 11 6
41
01
02

B 8 5 9 6
5/2
GP

C 4 7 10 7
2/0
CE

D 10 4 8 3
82
.23

b) Explain the significance and applications of assignment and transportation

problem. [6]
16
8.2
.24

[6263]-221 2
49
Q5) a) A bank has decided to modernize its office. The major elements of the

8
project are as follows.

23
ic -
Activity Description Predecessor Duration

ta t
Activity (Days)

4s
A Design New Premises --- 14

0:3
02 91
4:0
B Obtain tenders from contractors A 4

0
41
C 2/0 13
Select the contractor B 2
0
D Arrange details with selected contractor C 1
5/2
.23 GP

E Decide which equipment is to be used A 2

E
82

8
F Arrange storage of equipment E 3
C

23
ic-
G Arrange disposal of other equipment E 2
16

t
sta
H Order new equipment E 4
8.2

:34
.24

I Take delivery of new equipment H, L 3

91
:00
49

J Renovations take place K 12

14
30

K Remove old equipment for storage or

24
01

disposal D, F, G 4
/20
GP
/05

L Cleaning after the contractor finished J 2

2
CE

M Return old equipment for storage H, L 2

82

8
23
.23

i) Draw an arrow diagram for this project

ic-
16

tat
ii) Find out the critical path
8.2

4s

iii) For each non-critical activity find out the total, free and independent
.24

0:3

float or Slacks. [12]

91
49

4:0
30

b) Explain in brief following (Any 3) : [6]

41
01

i) Gradual failure
02
5/2
GP

ii) Sudden failure

2/0

iii) Progressive failure

CE
82

iv) Retrogressive failure

.23
16

v) Random failure
8.2

OR
.24

[6263]-221 3
49
Q6) a) A truck owner finds from his past records that the maintenance cost per

8
year of a truck whose purchase price is Rs. 8,000 are as follows : [10]

23
ic -
Year 1 2 3 4 5 6 7 8

ta t
4s
Maintenance Cost (Rs.) 1000 1300 1700 2000 2900 3800 4800 6000

0:3
02 91
Resale price (Rs.) 4000 2000 1200 600 500 400 400 400

4:0
0
41
Determine at which time it is profitable to replace the truck.
2/0 13
b) Differentiate between CPM and PERT and also discuss various floats
0
5/2
.23 GP

involved in the in CPM analysis of network. [8]

E
82

8
C

23
Q7) a) A salesman located in a city A decided to travel to city B. He knew the

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

t
sta
8.2

highway network map as show in following figure. The city of origin A, is

:34
city 1. The destination city B is city 10. Other cities through which the
.24

91
salesman will have to pass through are numbered 2 to 9. The arrow
:00
49

representing routes between cities and distances in kilometers are located

14
30

on each route. The salesman problem is to find the shortest route that
24
01

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

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

GP
2 /05
CE
82

8
23
.23

ic-
16

tat
8.2

4s
.24

0:3
91
49

4:0
30
41
01
02
5/2
GP
2/0
CE
82
.23
16
8.2
.24

[6263]-221 4
49
 Activity Duration Activity Duration

8
23
1-2 4 4-5 6

ic -
1-3 6 4-6 10

ta t
1-4 3 4-7 5

4s
2-5 7 5-8 4

0:3
2-6 10 5-9 8

02 91
4:0
2-7 5 6-8 3

0
41
3-5 2/0 13 3 6-9 7
3-6 8 7-8 8
0
5/2
.23 GP

3-7 4 7-9 4
8-10 7
E
82

8
9-10 9
C

23
ic-
b) Explain in brief methodology of Monto Carlo Simulation. [5]
16

t
sta
8.2

Q8) a) A company has five salesmen who have to be allocated to four marketing

:34
.24

zones. The return (profit) from each zone depends upon the numbers of
91
:00
49

salesman working in that zone. The expected return for different numbers
14
30

of salesman in different zones, as estimated from the past record, are

24

given in the following table. Determine the optimum allocation policy.

01
/20

(Use Dynamic Programming). [12]

GP
/05

Number of Marketing Zones

Salesmen Zone 1 Zone 2 Zone 3
2
CE
82

8
0 30 35 42

23
.23

ic-
1 45 45 54
16

tat
2 60 52 60
8.2

4s

3 70 64 70
.24

0:3

4 79 72 82
91
49

4:0

5 90 82 95
30
41

6 98 93 102
01
02

7 105 98 110
5/2
GP

8 100 100 110

2/0

9 90 100 110
CE
82

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

.23
16
8.2


.24

[6263]-221 5
49