4 3/
Roll. No.-
Total No ofpages: 02
B.Tech. [EE]
Third Semester
Nov/Dec 2019
End-Term Examination
MC261;
Numerical
& Engineering Optimization
Metbods
Max. Marks: 40
Time: 3 hrs.
Notes:
.Attempt any
2.
five questions.
marks.
All questions carry cqual
3. Assume missing sta if any
algorithm
Write
Q1(a)
by Bisection method.
an
(b)
Find a real
root
to three decimal places.
for
finding
root
ofan algebraic equation ofone variable
B
x'-2x-5-0
ofthe equation
by Regula-falsi
method
correct
Q2. Find the maximum value of Z= 2x+3y
Subjected to the constraints
x+y 30,
y23
0sys12
x-y20
8
0sxS20
Q3.
Find the minimum value of
Fx-5x-20x+5
Perform
two
interactions
using quadratic interpolation
and discuss the result.
8
Q4. Minimize
f(x1, x)=XI -X2 + 2x +2x1x2 +X
Starting from the point Xi 0
Take Axi- Ax
=
0.8
and
E
=0.1
Perform only one complete interaction for method of Pattern Directions.
18
P.T.O.
05
(a) Give
a
general
fomulation
of
ultivariable optimizaticn
constrained multivar:.
probiem.
(Expluinthe penalty function method for
Q6.
Expilain the general
with the
07. Write notes
an
example.
on
any two
a) Optimality Criterion
b) Fibonacci method
c)
d)
a
approach of solving an optimization
Algorithm.
Name various GA
of
help
timizing contained
operations
of the following
Random walk
Steepest descentmethod
method
and
problem
em
problem,
with the 15
illustrate
strate each operator
help
8
2x4-3
-END-