Printed pages: Sub Code: MTEE053

Paper Id 2 2 0 2 0 9 Roll No.

M.TECH.
(SEM -II) THEORY EXAMINATION 2019-20
OPTIMIZATION TECHNIQUES
Time: 2 Hours Total Marks: 70
Notes:
a) This paper contains three Sections A, B and C. Section A carries 18 marks with each question
is of 03 marks. Section B carries 22 marks with each question is of 11 marks and Section C
carries 30 marks with each question carries 10 marks.
b) Attempt any 06 parts from Section A, Any 02 parts from Section B and Any 03 parts from
Section C.
c) Assume any missing data suitably.

SECTION A

1. Attempt any 06 parts questions in brief.

a. State the various methods available for solving a multivariable optimization
problem with equality constraints.
b. Define Fabonacci numbers.
c. Write the Kuhn–Tucker condition if the optimization problem is to maximize f
(x1, x2, ......, xn) subjected to the inequality constraints gj ≤ 0, j = 1, 2, ....., m.
d. What is optimization? Give engineering application of optimization.
e. Explain objective function with example.
f. What is golden section?
g. What is Descent method?
h. What is graphical optimization?
i. Classify various types of optimization problem.
j. Define saddle point

SECTION B

2. Attempt any two parts of the following:

a. State the optimization problem. Classify and explain various types of optimization
problems with examples.
b. Explain interior penalty function method for a constrained non-linear programming
problem.
c. Min Z = 2x12 – 24x1 + 2x22 – 8x2 + 2x32 – 12x3 +20
st x1 + x2 + x3 =1 xi ≥ 0
d. Solve the following LPP by Big M method:
Max Z = 4x1 + 3x2 + 5x3
St x1 + 3x2 + 2x3 ≤ 10
2x1+ 2x2 + x3 ≥ 6
x1 +2 x2 +3x3 = 14
e. (i) Write the dual of the following linear programming problem.
MinimizeZ=5x1-6x2+4x3
 Subject to 3x1+4x2+6x3≥9
x1+3x2+2x3≥5
7x1-2x2-x3≥10
x1-2x2+4x3≥4
2x1+5x2-3x3≥3
&x1,x2,x3≥0
(ii)Discuss the concept of feasible direction method of constrained optimization
technique.

SECTION C
[Attempt any 03 parts of the following]
3. Attempt any one part of the following:
(a) Explain the following with suitable examples:
a) Design vector b) Objective function c) Constraints.
(b) A company produces two types of hats. Each hat of first type requires twice
as
much as labour time as second type. If all hats are of the second type only,
the
company can produce a total of 500 hats a day. The market limits daily sales
of
the first and second type to 150 and 250 hats. Assuming that the profits per
hat are Rs.8 for type A and Rs.5 for type B, formulate the problem as linear
model in order to determine the number of hats to be produced of each type
so as to
maximize the profit. Solve it by simplex method.
4. Attempt any one part of the following:
(a) State the characteristics of Fibonacci method
(b) Find Min Z = x3 -3x -5. Take initial interval as [0, 1.2] and accuracy α = 10%.
Solve it by Fibonacci method.
5. Attempt any one part of the following:
(a) Define the gradient of the function. Explain its importance in optimization.
(b) Using penalty function method, solve the following problem.
Min Z = (x2-1)2+4(x2-3)2
st x12 + X22 = 5
6. Attempt any one part of the following:
(a) Min Z = X12 + X22 +X32
St X1 + 2X2 + 3X3 = 7
X1 + 2X2 + 3X3 = 7
2X1 + 2X2 + X3 = 4.5
Using penalty function method
(b) Min f=(x12 + x2-11)2+(x1+x22-7)2 subject to (x1-5)2+x22-26 ≥0 and x1, x2≥0. Use
Penalty function method. Show calculations for two sequences. Take R=0.1.
7. Attempt any one part of the following:
(a) State the Bellman’s principle of optimality. Explain its application in multi-
stage decision process with suitable example.
(b) Show that the Newton’s method finds the minimum of the quadratic function
in one iteration.