Scribd
Upload
14 views2 pages

r 41028102019

Uploaded by

Gurijala Pvprrao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views2 pages

r 41028102019

Uploaded by

Gurijala Pvprrao
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Code No: R41028 R10

IV B.Tech I Semester Supplementary Examinations, October/November - 2019


Set No. 1

OPTIMIZATION TECHNIQUES
(Mechanical Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry equal marks
*****

1 State the optimization problem. Classify and explain various types of


optimization problems with examples. [15]

2 a) State and explain Kuhn-Tucker conditions applicable to non-linear


programming problem. [8]
b) Use Kuhn-Tucker conditions to solve Max Z= 2x12 +12x1x2-7x22 subject to
2x1+5x2 <= 98 and x1,x2 >= 0. [7]

3 a) Use simplex method to solve the following LP problem minimize


Z=5x+6y subject to the following constraints: 2x+5y≥1500;
3x+y≥ 1200 and x, y≥0. [8]
b) Can the Simplex method find the global solution to convex set programming
problems? [7]

4 Determine the optimal solution for the transportation matrix given below.

Is the solution unique? If not give alternate solution [15]

5 a) Find by Fibonacci method Minimum of f(x) = x3-3x+5, 0≤ x ≤ 1.2 within an


interval of uncertainty 0.35 L0 where L0 is the original interval of
uncertainty [8]
b) What are the differences between elimination and interpolation methods? [7]

6 Using Powel’s method


Minimize f(x) =x1-x2 + 2x12 +2x1x2 +x22 from the starting point x1= (0,0) [15]

1 of 2

|''|'''||''||'''|||| www.manaresults.co.in
Code No: R41028 R10 Set No. 1
7 a) What do you understand by the term ‘penalty’ in a constrained multivariable
optimization problem? [3]
b) Consider the problem: Minimize f(x) = x12+x22−6x1−8x2+ 15
Subject to 4x12+x22≥ 16
3x1+5x2≤ 15
Normalize the constraints and find a suitable value of r1 for use in the interior
penalty function method at the starting point (x1, x2) = (0, 0). [12]

8 a) Explain the typical applications of Dynamic programming in EEE. [8]


b) What are the limitations of Dynamic programming? [7]

2 of 2

|''|'''||''||'''|||| www.manaresults.co.in

You might also like