Scribd
Upload
49 views1 page

Q Paper2

This document contains 8 questions regarding optimization techniques for a mechanical engineering exam. The questions cover topics such as applications of optimization in electrical engineering, Kuhn-Tucker conditions, solving optimization problems with constraints, overcoming redundancy and degeneration in transportation problems, difference between elimination and interpolation methods, Powell's method, penalty function methods, and dynamic programming. Students were asked to solve optimization problems, define terms, explain concepts, and provide examples.

Uploaded by

Aparna das
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
49 views1 page

Q Paper2

This document contains 8 questions regarding optimization techniques for a mechanical engineering exam. The questions cover topics such as applications of optimization in electrical engineering, Kuhn-Tucker conditions, solving optimization problems with constraints, overcoming redundancy and degeneration in transportation problems, difference between elimination and interpolation methods, Powell's method, penalty function methods, and dynamic programming. Students were asked to solve optimization problems, define terms, explain concepts, and provide examples.

Uploaded by

Aparna das
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/ 1

Set No.

1
Code No: R41028 R10
IV B.Tech I Semester Supplementary Examinations, October/November - 2017
OPTIMIZATION TECHNIQUES
(Mechanical Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry equal marks
*****
1 a) Write the typical applications of optimization in the field of electrical engineering. [7]
b) What are the differences between a constraint surface and a composite constraint
surface? [8]

2 a) State the Kuhn–Tucker conditions. [7]


b) Find the dimensions of a cylindrical tin (with top and bottom) made up of sheet
metal to maximize its volume such that the total surface area is equal to A0 = 24 π. [8]

3 a) Define the following terms: point, hyperplane, convex set, extreme point. [7]
b) Maximize f = 240x1 + 104x2 + 60x3 + 19x4
Subject to 20x1 + 9x2 + 6x3 + x4 ≤ 20
10x1 + 4x2 + 2x3 + x4 ≤ 10
xi ≥ 0, i = 1 to 4
Find all the basic feasible solutions of the problem and identify the optimal
solution. [8]

4 How do you overcome (i) Redundancy and


(ii) Degeneration in transportation problems. [15]

5 a) What are the differences between elimination and interpolation methods? [7]
b) Find the value of x in the interval (0, 1) which minimizes the function f = x(x −
1.5) to within ±0.05 by the Fibonacci method. [8]

6 a) What are the roles of univariate and pattern moves in the Powell’s method? [7]
b) Perform two iterations of the steepest descent method to minimize the function of
(x1, x2) = 100(x2 − x12 )2 + (1 − x1)2 from the starting point (−1.2, 1.0)T. [8]

7 a) Why is handling of equality constraints difficult in the penalty function methods? [7]
b) Minimize f (x1, x2) = 13 (x1 + 1)3 + x2
Subject to g1(x1, x2) = −x1 + 1 ≤ 0
g2(x1, x2) = −x2 ≤ 0 [8]

8 a) Explain the computational procedure used in dynamic programming. [7]


b) State Bellman’s principle of optimality and explain by an illustrative example how
it can be used to solve multistage decision problem. [8]

1 of 1
www.ManaResults.co.in
|''|'''||''||'''||||

You might also like