SECTION - I

Q1) a) What is meant by optimization. Why it is necessary? [8]

b) Give classification of optimization techniques. [8]
Q2) a) Explain the methodology of Fabbonci search analysis. [8]
b) What are the significant charactreistics of Newton-Raphson Method? [8]
Q3) a) Explain the Golden section search methods. [8]
b) Explain the evaluationary optimization method. [8]
Q4) a) Explain Steepest Descent method of optimization. [8]
b) What is meant by multi-variable optimization? State the methods of it. [8]
Total No. of Questions :10] [Total No. of Pages :2
[4065] - 716
M.E. (Production Engineering)
OPTIMIZATION TECHNIQUES
(2008 Course) (511112 (a)) (Elective - IV)
Time : 3 Hours] [Max. Marks :100
Instructions to the candidates:
1) Answer any three questions from each section.
2) Answers to the two sections should be written in separate answer books.
3) Neat diagrams must be drawn wherever necessary.
4) Assume suitable data, if necessary.
5) Figures to the right indicate full marks.
6) Use non-programmable electronic calculators is allowed.
P1633
P.T.O.
[4065]-716 2
Q5) Write short note on following ( Any two): [18]
a) Secant Method.
b) Optimization in Engineering Applications.
c) Powells Conjugate direction method.
d) Newtons Gradiant based method.
SECTION - II
Q6) a) What is meant by constraint handling? Explain any one method of
constrained optimization. [8]
b) Explain gradient projection method with its characteristics. [8]
Q7) a) Explain the method of geometric programming. [8]
b) Explain the specialized algorithms for integer programming. [8]
Q8) a) Explain the generalized reduced gradient method. [8]
b) Explain the various gradient based methods. [8]
Q9) a) Explain the steps involved in genetic algorithm. [8]
b) Explain the differences and similarities between Genetic Algorithm and
traditional methods. [8]
Q10) Write Short notes on (Any two): [18]
a) Method of feasible direction.
b) Simulated Annealing method.
c) GA for constrained optimization.
TTT