J

N
T
U
W
O
R
L
D
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Code No: D1503
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M.Tech II SEMESTER EXAMINATIONS, APRIL/MAY-2013
ADVANCED OPTIMIZATION TECHNIQUES
(MACHINE DESIGN)
Time: 3hours Max.Marks:60
Answer any five questions
All questions carry equal marks
- - -

1.a) What is normality condition in a geometric programming problem?
b) Minimize f = x
1
1
x
2
2
x
3
2

subject to:
x
1
3
+ x
2
2
+ x
3
1
x
i
>0, i = 1, 2, 3

2.a) Explain the influence of dimensionality, in solving large-size dynamic programming
problems.
b) A minimum-cost pipeline is to be laid between points (towns) A and E.
The pipeline is required to pass through one node out of B
1
, B
2
, and B
3
, one out of
C
1
, C
2
, and C
3
, and one out of D
1
, D
2
, and D
3
(see Fig.). The costs associated with
the various segments of the pipeline are given below:

For the segment
starting at A
For the segment
ending at E
A B
1
10 D
1
E 9
A B
2
15 D
2
E 6
A B
3
12 D
3
E 12












Contd2
R09
www.jntuworld.com
www.jntuworld.com
www.jwjobs.net www.android.jntuworld.com
J
N
T
U
W
O
R
L
D
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
Q6
::2::


For the segments B
i
to C
j
and C
i
to D
j

To node j
From node
i
1 2 3
1 8 12 19
2 9 11 13
3 7 15 14
Find the solution using dynamic programming.

3.a) Why Balas method is called the pseudo dual simplex method?
b) Maximize f = x
1
+2x
2
by branch and bound method.
subject to:
x
1
+x
2
7
2x
1
11
2x
2
7
x
1
, x
2
0 and

integers.

4.a) Explain neural-network-based optimization through a Multilayer feed forward network.
b) Consider the following two strings denoting the vectors X
1
and X
2
:
X
1
: {1 0 0 0 1 0 1 1 0 1}
X
2
: {0 1 1 1 1 1 0 1 1 0}
Find the result of crossover at location 2. Also, determine the decimal values of
the variables before and after crossover if each string denotes a vector of two
variables.


5.a) Write a Hessian matrix of second derivatives and define local maxima, local
minima and saddle point.
b) Maximize the quadratic function f(x, y) = -x
2
+ xy - y
2
+ 1 along a direction
[x = 0; y = 1] from the point [x
0
= 1; y
0
= 0] using direct search method.

6.a) Illustrate the four methods of cross-over used in GA with examples.
b) Using arithmetic meangeometric mean inequality, obtain a lower bound v for the
given function [f (x) v, where v is a constant]


7.a) How is the error in the output minimized during neural network training?
b) Draw a block diagram of a possible fuzzy logic control system. Explain about
each block.


8.a) How is a neuron modeled in neural-network-based models?
b) Explain in detail, the physical basis of Simulated Annealing.

*****
www.jntuworld.com
www.jntuworld.com
www.jwjobs.net www.android.jntuworld.com