53205-mt - Optimization Techniques
Uploaded by
SRINIVASA RAO GANTA53205-mt - Optimization Techniques
Uploaded by
SRINIVASA RAO GANTACode No: 53205/MT
NR
M.Tech. – II Semester Regular Examinations, September, 2008
OPTIMIZATION TECHNIQUES
(Machine Design)
Time: 3hours Max. Marks:60
Answer any FIVE questions
All questions carry equal marks
---
1.a) What is meant by mathematical models of a real solution? Discuss
the importance of models in the solution of optimization problems.
b) What are the various methods of optimization techniques?
Discuss.
2. Solve the following linear programming problems:
Max. Z = x1 + x2 + 3 x3 − x4
Subjected to x1 + 2 x2 + 3 x3 = 15
2 x1 + x2 + 5 x3 = 20
x1 + 2 x2 + x3 + x4 = 10
x1 , x2 , x3 ≥ 0
3. Solve the following assignment problem:
Job \ Machine 1 2 3 4 5
A 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15
4. Find the extreme points of the function:
f ( x1 , x2 ) = x13 + x23 + 2 x12 + 4 x22 + 6
Contd…2
Code No: 53205/MT ::2::
5. Minimize f ( x1 , x2 ) = x1 − x2 + 2 x12 + 2 x1 x2 + x22 starting from the point
0
X 1 = , take ∆x1 = ∆x2 = 0.8 and C = 0.1.
0
6. Minimize f = 4 x12 + 3 x22 − 5 x1 x2 − 8 x , starting from point (0, 0) using
Powel’s method. Perform four iterations.
7.a) What are the basic operations used in Genetic Algorithms?
Explain.
b) Construct the objective function to be used in Genetic Algorithms
for a minimization problem with mixed equality and in equality
constraints.
8.a) What is neural network? How is the error in the output minimized
during network training?
b) How is the fuzzy feasible domain defined for a problem with
inequality constraints?
c) Explain briefly the working principle of simulated annealing.
*****
