5

03
B

74
43
EF
28
Paper / Subject Code: 32625 / Department Optional Course-I: Optimization Techniques

A8
EA
5A
BF
E9

74
43
1T01435 - T.E.(Mechanical) Engineering)(SEM-V)(Choice Base Credit Grading System ) ((R-20-21) (C Scheme) / 32625 -

EF

0
5B

28

A8
EA
5A
BF
Department Optional Course-I: Optimization Techniques

E9
2C

74
43
EF
5B

8
QP CODE: 10014340 DATE: 02/12/2022

2E

EA
2

A
F
E9
2C
1C

5
B

43
F
B

28
E

E
0
Time: 3 Hrs Marks : 80

5A
5
2
F7

BF
9
2C
1C

EF
3B

4
E
0

A
C5
1) Question No. 1 is compulsory.

C2
F7

BF
0

F5
A8

BE
2
3B

1
2) Answer any three out of the remaining five questions.

28
E

FE
0
74

5
2
7
0

9
C
1C
3) Figures to the right indicate full marks.

BF

8B
A8

E
EA

B
2E
70
03

2
74
4) Illustrate answers with neat sketches wherever required.

5
3

E9
2C
A4

C
F
8
EA

B
A

01

8
E
F5

2
74

C5
3

2
F7
80

E9
A4

C
FE

EA

E2
B
4A

01

B
5

3
8B

5
3

C2
7
EF
Q. 1 Explain briefly any four 20

0
A7

2C
A4

F
8
2

3B
A

01
BF
E9

E
5

4
3

C2
F7
EF
a Robust design

0
A7
5B

28

A4

2
B
4A

01
BF
E9

E
2C

2E
5

3
43

F7
EF

0
A7
5B

28

1C
2E

8
A
b

3B
Engineering applications of optimization

4A
BF
E9

E
2C
1C

70
5

3
F

80
7
5B

28

A4
2E

BF
FE
70

4A
E9

3E
2C
1C

5
BF

03
B
c Integer Programming

EF

A7
5B

4
2E

A8
70
03

5A
BF
E9

E
2C
1C
BF
A8

74
3
EF
5B

28

4
2E
70

EA
03
74

5A
BF
E9
2C
1C
BF
A8
EA

43
EF
d Genetic Algorithm
5B

28
2E
70
03
74

5A
43

BF
9
2C
1C
BF
A8

E
EA
A

EF
B

8
2E
70
F5

03

92
74

C5
43

BF
e Analytic Hierarchy Process (AHP) Method
C
BF
FE

A8

BE
EA
5A

E2
01

28
03
8B

74

5
43

C2
F7
EF

E9
2C
A8
EA
92

5A

3B

1
BF

a Explain design of experiments. Explain its application and state its

5B
Q2 10
2E
70
BE

74
43
EF

80
28

2C
importance.
C
F
EA
A
C5

B
4A

01
BF
E9

2E
F5

3
43
E2

F7
0
A7
5B

28

b A firm manufacture product P & Q which pass through machining and 10

1C
FE

8
A

3B
C2

4A
E9

3E
2C

70
F5

finishing departments. Machining has 90 hours available; finishing can

8B

80
01

A7
5B

A4
2E

BF
FE
92

handle up to 72 hours of work. Manufacturing one product P requires

4A
F7

3E
2C
1C

F5

03
8B
BE

A7

6 hours in machining and 3 hours in finishing. Each product Q requires

A4
2E

FE

A8
70

2
C5

E9

3E
1C

3 hours in machining and 6 hours in finishing. If profit is Rs. 120/- per

F5
BF

8B

74
E2

5B

4
FE
70

EA
03

product P and Rs. 90/- per product Q. Formulate as goal

5A
C2

E9
C
BF

8B
A8

43
E2

EF
01

programming problem to determine combination of product P & Q

5B
03

2
74

5A
C2
F7

BF
E9
C

to realise profit of exactly Rs. 2100

A8

E2

EF
3B

01

5B

28
74

C2
F7

BF
80

E9
C

Find the maximum and minimum value of y = 3x5 – 5x3.

EA

Q3 a 10
E2
3B
4A

01

5B

28
43

C2
F7
80

E9
A7

2C

b Solve LPP by simplex method 10

5A

3B
4A

01

5B
3E

2E
F7
EF

Maximize: Z = 40x1 + 35x2 subjected to,

80
A7

2C
A4

1C
3B
4A

2x1 + 3x2 ≤ 60
3E

2E
70
F5

80
7
A4

1C

4x1 + 3x2 ≤ 96
BF
FE

EA

4A

70
F5

03
8B

x1, x2 ≥ 0
43

BF
FE

A8
EA
92

5A

03
8B
BE

74
43
EF

A8
EA
92

5A
BF
BE

74
43
EF
28

EA
5A
C5

BF
E9

43
E2

EF
5B

28

14340 Page 1 of 2
5A
C2

BF
E9
2C

EF
01

5B

28
2E

BF
E9
2C
1C

F701C2E2C5BE928BFEF5A43EA74A803B
5B

28
2E
70
 5

03
B

74
43
EF
28
Paper / Subject Code: 32625 / Department Optional Course-I: Optimization Techniques

A8
EA
5A
BF
E9

74
43
QP CODE: 10014340

EF

0
5B

28

A8
EA
5A
BF
E9
2C

74
43
EF
5B

8
2E

EA
2

A
F
E9
2C
1C

5
B

43
a Solve following problem by big M method

F
Q4 10

28
E

E
0

5A
5
2
F7

BF
9
Minimize Z = 600x1 + 500x2 subjected to,

2C
1C

EF
3B

4
E
0
2x1 + x2 ≥ 80

A
C5
C2
F7

BF
0

F5
A8

BE
2
3B

1
x1 + 2x2 ≥ 60, where x1, x2 ≥ 0.

28
E

FE
0
74

5
2
7
0

9
C
1C
BF

8B
A8

E
EA

B
2E
70
03

2
74

5
3

E9
2C
A4

C
F
8
EA
b Write the dual of the following primal LP problems 5

B
A

01

8
E
F5

2
74

C5
3

2
F7
Max Z = 2x1 + 5x2 + 6x3

80

E9
A4

C
FE

EA

E2
subject to (i) 5x1 + 6x2 – x3 ≤ 3 (ii) – 2x1 + 3x2 + 4x3 ≤ 4 (iii) x1 – 5x2

B
4A

01

B
5

3
8B

5
3

C2
7
EF
+ 3x3 ≤ 1 (iv) – 3x1 – 3x2 + 7x3 ≤ 6 and x1, x2, x3 ≥ 0

0
A7

2C
A4

F
8
2

3B
A

01
BF
E9

E
5

4
3

C2
F7
EF

0
A7
5B

28

A4

2
B
4A

01
BF
E9

E
2C

c State methods of normalization and explain any one.

2E
5

3
43

F7
EF

0
A7
5B

28

1C
2E

8
A

3B
4A
BF
Solve the following NLPP: Maximum Z = 4x1 + 6x2 – 2x1x2 – 2x22
E9

E
a
2C

Q5 10
1C

70
5

3
F

80
7
5B

28

A4
2E

subjected to x1 + 2x2 = 2, x1, x2 ≥ 0.

BF
FE
70

4A
E9

3E
2C
1C

5
BF

03
B

EF

A7
5B

4
2E

A8
70
03

5A
BF
E9

E
2C
1C
BF

b Explain concept of dynamic programming and bellman's principle of

A8

10

74
3
EF
5B

28

4
2E
70

EA
03
74

5A
BF
optimality E9
2C
1C
BF
A8
EA

43
EF
5B

28
2E
70
03
74

5A
43

BF
9
2C
1C
BF
A8

E
EA
A

EF
B

8
2E
70
F5

03

92
74

C5
43

Q6 a Explain multi attribute decision making with suitable illustration 10

BF
C
BF
FE

A8

BE
EA
5A

E2
01

28
03
8B

Explain briefly taguchi’s loss function

74

b 5 5
43

C2
F7
EF

E9
2C
A8
EA
92

5A

3B

1
BF

5B
2E
70
BE

74
43
EF

80
28

2C
C
F
EA

c A production process makes batteries for 9 +/- 0.25 volts applications 5

A
C5

B
4A

01
BF
E9

2E
F5

3
43
E2

F7
0

at a cost of $ 0.75 each. Determine:

A7
5B

28

1C
FE

8
A

3B
C2

4A
E9

3E
2C

70
F5
8B

80
01

A7
5B

a. Complete expression for loss function

A4
2E

BF
FE
92

4A
F7

3E
2C
1C

F5

03
8B
BE

A7
A4

b. Loss when a part is made at 9.10 V

2E

FE

A8
70

2
C5

E9

3E
1C

F5
BF

8B

74
E2

5B

4
FE
70

EA
03

5A
C2

E9
C
BF

8B
A8

43
E2

EF
01

5B
03

2
74

5A
C2
F7

BF
E9
C
A8

E2

EF
3B

01

5B

28
74

**************
C2
F7

BF
80

E9
C
EA

E2
3B
4A

01

5B

28
43

C2
F7
80

E9
A7

2C
5A

3B
4A

01

5B
3E

2E
F7
EF

80
A7

2C
A4

1C
3B
4A
3E

2E
70
F5

80
7
A4

1C
BF
FE

EA

4A

70
F5

03
8B

43

BF
FE

A8
EA
92

5A

03
8B
BE

74
43
EF

A8
EA
92

5A
BF
BE

74
43
EF
28

EA
5A
C5

BF
E9

43
E2

EF
5B

28

14340 Page 2 of 2
5A
C2

BF
E9
2C

EF
01

5B

28
2E

BF
E9
2C
1C

F701C2E2C5BE928BFEF5A43EA74A803B
5B

28
2E
70