Total No. of Questions : 10] [Total No.

of Pages : 3
[3965]-514
M.E. (Mechanical) (Design Engineering)
OPTIMIZATION TECHNIQUES
(Revised 2008 Course) (502204 - (C)) (Elective - I)
Time : 3 Hours] [Max. Marks : 100
Instructions to the candidates:
1) Answer any three questions from each section.
2) Answer to each section should be written in separate books.
3) Neat diagrams must be drawn wherever necessary.
4) Figures to the right indicate full marks.
5) Use of pocket calculator is allowed.
6) Assume suitable data wherever necessary.
P1431
SECTION - I
Q1) a) How to identify the given problem requires optimization or not? What
are the methods to classify the problems of optimization? [6]
b) Find the second-order Taylors series approximation of the function.[10]
f (x
1
, x
2
, x
3
) =
2
2
x x
3
+ x
1

3
x
e
about the point x* =

'

'

'

-2
0
1
Q2) a) The step-cone pulley shown in fig.1 is to be designed for tansmitting a
power of at least 0.75 HP. The speed of the input shaft is 350 rpm and
the output speed requirements are 750, 450, 250 and 150 rpm for a fixed
centre distance of a between the input and output shafts. The tension
on the tight side of the belt is to be kept more than twice that on the slack
side. The thickness of the belt is t and the coefficient of friction between
the belt and the pulley is . Formulate the problem of finding the width
and diameters of the steps for minimum weight. [12]
P.T.O.
b) What is graphical optimization and what are its limitations. [4]
Q3) a) State the necessary and sufficient conditions for the maximum of a
multivariable function f (X). [6]
b) Find the maximum of the function
f (X) = 2x
1
+ x
2
+ 10 subject to
g (X) = x
1
+ 2
2
2
x = 3, using the Lagrange multiplier method. Also find the
effect of changing the right hand side of the constraint on the optimum
value of f. [10]
Q4) a) What is the pivotal reduction of general system and how it differs from
simplex algorithms? [6]
b) Find all the basic solutions corresponding to the system of equation by
pivotal reduction system. [10]
2x
1
+ 3x
2
2x
3
7x
4
= 1
x
1
+ x
2
+ x
3
+ 3x
4
= 6
x
1
x
2
+ x
3
+ 5x
4
= 4
[3965]-514 2
Q5) Write short note on any THREE : [18]
a) Inequality constraint.
b) Convex programming problems.
c) Postoptimality analysis.
d) Engineering applications of optimization.
SECTION - II
Q6) a) What are the limitations of classical methods in solving a one-dimensional
minimization problem? [6]
b) Find the minimum of the function
f ( ) = 0.65 (
,

-
-
-
1
tan 65 . 0
1
0.75
1
2
using quasi-Newton method with the starting point
1
= 0.1 and the step
size = 0.01 in central difference formulas. Use = = 0.01 for checking
the convergence. [10]
Q7) a) State the iterative approach used in unconstrained optimization. [6]
b) Minimize f (x
1
, x
2
) = x
1
x
2
+ 2
2
1
x + 2x
1
x
2
+
2
2
x from the starting point
X
1
=
'
`

'
'

0
0
using Powells method. [10]
Q8) Find the minimum of f =
5
5
3
20 + 5 by the cubic interpolation
method. [16]
Q9) a) Formulate the equivalent unconstrained objective function that can be
used in random search methods. [6]
b) Minimize f (x
1
, x
2
) = x
1
x
2
Subject to
g
1
(x
1
, x
2
) =
0 1 2 3
2
2 2 1
2
1
s - - - x x x x
using the cutting plane method. Take
the convergence limit in step 5 as = = 0.02. [10]
Q10) Write short note on any THREE : [18]
a) Descant method.
b) Penalty function method.
c) Grid search method.
d) Golden section method.
xxxx
[3965]-514 3