Total No.

of Questions : 6]

P1595

[Total No. of Pages : 2

[4065] - 474
M.E. (Civil) (Structures)
OPTIMIZATION TECHNIQUES
(2008 Course) (Elective - IV) (501412)

Time : 4 Hours]
[Max. Marks : 100
Instructions to the candidates:
1) Answer any two questions from each section.
2) Answers to the two sections 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 electronic pocket calculator is allowed.
6) Assume suitable data, if necessary.

SECTION - I
Q1) a)
b)

c)
Q2) a)
b)

c)

State engineering applications of optimization and explain mathematical

statement of optimization problem.
[6]
To design uniform column of rectangular cross section to avoid failure
due to direct compression and buckling, formulate an optimization
problem to minimize the mass of column for economy. Assume the
[12]
permissible compressive stress to be Vmax.
Find the maxima and minima of the function
[7]
f(x) = 12x5 45x4 + 40x3 + 5.
State and explain decomposition principle.
Maximize F = 6x1 + 7x2
Subject to
7x1 + 6x2 d 42
5x1 + 9x2 d 45
x1 x2 d 4
xi t 0, i = 1, 2
Using Big-M technique.
Maximize F = 5x + 2y
3x + 4y d 24, x y d 3,
Subject to x + 4y d 4, 3x + y t 3
x t 0, y t 0,
Using simplex method.

[6]
[10]

[9]

P.T.O.

Q3) a)
b)

Find the value of x in the interval (0, 1) which minimizes the function
f = x3 10x 2x2 + 10 to within 0.05 by Fibonacci method. [12]
Perform two iterations of the cubic search method to minimize the
function
[13]
2
3
4
f(x) = (x 1) (2x 5) .
SECTION - II

Q4) a)
b)
c)

Q5) a)

b)

Q6) a)
b)

What is the difference between random jumping and random walk

methods?
[5]
Minimize f = x12 + x22 2x1 4x2 + 5 from the starting point (1, 2)
using the univariate method (two iterations only).
[10]
Minimize f = 2x12 + x22 by using the steepest descent method with the
starting point (1, 2).
[10]
Complete one iteration of the reduced gradient technique for the
following NLP problem
[13]
2
2
Minimize x1 + x2
Subject to x1x2 9 = 0

2.0
Use a starting feasible solution X0 =
4.5
Minimize f = x2 2x 1
Subject to g1 = x + 1 t 0
Use the interior penalty function method.

[12]

Illustrate the working principles of Genetic Algorithms with an example

of unconstrained optimization problem.
[13]
Write a note on Neural Network based optimization.
[12]

vvvv

[4065]-474