Total No.

of Questions : 6]

SEAT No. :

P2221

[Total No. of Pages : 2

[4165] - 474
M.E. (Civil) (Structures)
OPTIMIZATION TECHNIQUES
(2008 Course) (Elective - IV (d)) (Sem. - II)
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)

Q3) a)
b)

How do you solve a maximization problem as a minimization problem.

[5]
Formulate an optimization problem for minimum weight and minimum
cost to design a rectangular reinforced concrete cantilever beam section
with a constraint on deflection criteria.
[12]
Find the maxima and minima of the function
[8]
3
2
f(x) = 4x 18x + 27x 7
Explain Post-Optimality analysis and bounded variable method. [6]
[13]
Maximize F = 5x1 + 4x2 + 3x3, Using simplex method.
Subject to
2x1 + 3x2 + x3 d 5
4x1 + x2 + 2x3 d 11
3x1 + 4x2 + 2x3 d 8
xi t 0, i = 1,2,3
Discuss the relationship between the regular simplex method, revised
simplex method & Big M method.
[6]
State the limitations for Fibinacci method.
[5]
Find the value of x in the interval (0, 1) which minimizes the function
f = (x 1.5)x to within 0.05 by using golden section method. [10]
P.T.O.

c)

Derive the one-dimensional minimization problem for the following

case
[10]
2
2
f = x1 x2 + 2x1 + 2x1x2 + x2
From starting point X1 ={0, 0} along the direction S = {-1, 0}
Then minimize the function using quadratic interpolation method with
an initial step length of 0.1.
SECTION - II

Q4) a)

Minimize f = (x1 + 2x2 7)2 + (2x1 + x2 5)2

If a base simplex is defined by the Vertices
X1

b)
Q5) a)

 2
, X 2
 2

 3
, X 3
0

[12]

 1

 1

Find a sequence of two improved vectors using reflection, expansion

and/or contraction.
[13]
Minimize f = 100(x2 x12)2 + (1 x1)2 from the starting point
{1.2, 1.0} using steepest descent method (two iterations only).
Minimize f = x12 + x22 6x1 8x2 + 10
4x12 + x22 d 16
Subject to 3x1 + 5x2 d 15
xi t 0,i = 1,2

[13]

1.0
1.0

Use a starting point X 1

b)

Using SLP complete one step of the process.

Complete one iteration of the GRG method for the problem
Minimize f = x12 + x22
Subject to x1x2 9 = 0

[12]

2.0

4.5

Starting from X 1
Q6) a)
b)

Illustrate the working principles of Genetic Algorithms with an example

of unconstrained optimization problem.
[13]
What is a neural network? How is a neuron modeled in neural network
based models?
[12]
vvvv

[4165]-474