Scribd
Upload
18 views1 page

Q Paper1

The document discusses optimization techniques for a class exam. It contains 7 questions related to topics like single and multivariable optimization, necessary and sufficient conditions for optimization with constraints, linear programming problems solved using the simplex method, transportation problems, Fletcher-Reeves method for optimization, and dynamic programming. The questions cover techniques for constrained optimization and examples of applying these techniques.

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
18 views1 page

Q Paper1

The document discusses optimization techniques for a class exam. It contains 7 questions related to topics like single and multivariable optimization, necessary and sufficient conditions for optimization with constraints, linear programming problems solved using the simplex method, transportation problems, Fletcher-Reeves method for optimization, and dynamic programming. The questions cover techniques for constrained optimization and examples of applying these techniques.

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, March – 2017
OPTIMIZATION TECHNIQUES
(Open Elective Except for Electrical and Electronics Engineering)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions
All Questions carry equal marks
*****
1 a) Explain a single variable optimization technique. [8]
b) Find the maxima and minima of

[7]

2 a) State and explain the necessary and sufficient conditions for existence of relative
optima in case of multivariable optimization with constraints. [8]
b) Find the dimensions of a rectangular parallelepiped with largest volume whose
sides are parallel to the coordinate planes, to be inscribed in the ellipsoid. [7]

3 Max Z = 2x1 + 4x2 + 2x3


S.t. 2x1 + x2 - x3 ≤ 3
- 2x1 + x2 - 5x3 ≥ - 6
4x1 + x2 + x3 ≤ 6
x1, x2, x3 ≥ 0. [15]

4 a) Discuss simplex algorithm wrt LPP [7]


b) Solve the following LPP by simplex method
Max Z = 12x1 + 15x2
subject to 2x1 + 5x2 ≤10
4x1 + 3x2 ≤ 12
x1, x2 ≥ 0. [8]

5 a) Compare transportation problem with simplex method [7]


b) Solve the following transportation problem

[8]

6 a) Draw the flowchart for the Fletcher and Reeves method and explain about each
block. [8]
b) What are the advantages of this method over other methods? [7]

7 Classify the constrained optimization techniques and briefly explain each


technique. [15]

8 a) What is a multistage decision problem? [7]


b) State two engineering examples of Serial Systems that can be solved by dynamic
programming. [8]
1 of 1
WWW.MANARESULTS.CO.IN
|''|'''||''||'''||||

You might also like