Scribd
Upload
37 views

B.Tech III Year II Semester (R13) Regular Examinations May/June 2016

This document is an exam for an Optimization Techniques course. It contains 11 multiple choice questions covering topics like design variables, object function surfaces, Kuhn Tucker conditions, multivariable optimization problems, nonlinear programming, penalty functions, constrained problems, and dynamic programming. It also contains 5 long answer questions involving applying optimization methods to example problems involving functions, systems of equations, and manufacturing scheduling. The goal is for students to demonstrate their understanding of optimization techniques.

Uploaded by

rub786
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
37 views

B.Tech III Year II Semester (R13) Regular Examinations May/June 2016

This document is an exam for an Optimization Techniques course. It contains 11 multiple choice questions covering topics like design variables, object function surfaces, Kuhn Tucker conditions, multivariable optimization problems, nonlinear programming, penalty functions, constrained problems, and dynamic programming. It also contains 5 long answer questions involving applying optimization methods to example problems involving functions, systems of equations, and manufacturing scheduling. The goal is for students to demonstrate their understanding of optimization techniques.

Uploaded by

rub786
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code: 13A02607 www.FirstRanker.

com R13
www.FirstRanker.com

B.Tech III Year II Semester (R13) Regular Examinations May/June 2016


OPTIMIZATION TECHNIQUES
(Electrical & Electronics Engineering)
Time: 3 hours Max. Marks: 70
PART - A
(Compulsory Question)
*****
1 Answer the following: (10 X 02 = 20 Marks)
(a) Define design variables.
(b) Explain object function surfaces.
(c) Write Kuhn Tucker conditions.
(d) Define multivariable optimization problem with no constraints.
(e) What is Fibonacci method?
(f) What is nonlinear programming?
(g) Discuss penalty function.
(h) Write characteristics of constrained problem.
(i) What is dynamic programming?
(j) Give an example to multistage decision process.

PART - B
(Answer all five units, 5 X 10 = 50 Marks)
UNIT - I
2 Determine maximum and minimum values of the function .
OR
3 Find extreme points of the function
om

UNIT - II
4 Find all the basic solutions corresponding to the system of equations:
r.c
ke
an

OR
5 Maximize Subjected to
tR
irs
.F

UNIT - III
w

6 Show that the Newtons method finds the minimum of a quadratic function in one iteration.
w

OR
w

7 Discuss Powells method using quadratically convergent method.


UNIT - IV
8 Write algorithm used for interior penalty function method.
OR
9 Write algorithm used for exterior penalty function method.
UNIT - V
10 Discuss computational procedure in dynamic programming.
OR
11 A small machine tool manufacturing company entered into a contract to supply 80 drilling machines at
the end of month and 120 at the end of second month. The unit cost of manufacturing a drilling
machine in any month is given by (50x + 0.2x2), where x denotes the number of drilling machines
manufactured in that month. If the company manufactures more than needed in the first month, there
is an inventory carrying cost of 8 for each unit carried to next month. Find the number of drilling
machines to be manufactured in each month to minimize the total cost. Assume that the company has
enough facilities to manufacture up to 200 drilling machines per month and that there is no initial
inventory. Solve the problem as www.FirstRanker.com
a final value problem.
*****

You might also like