Scribd
Upload
215 views4 pages

Question Bank AOT

This document appears to be a question bank for an advanced optimization techniques course. It contains 58 questions related to optimization concepts like saddle points, convexity, Lagrange multipliers, penalty methods, genetic algorithms, and other numerical optimization techniques. The questions range from short-answer definitions to multi-part problems requiring the application of optimization methods to find minimum/maximum values of functions subject to various constraints.

Uploaded by

AMIT SOLANKI
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
215 views4 pages

Question Bank AOT

This document appears to be a question bank for an advanced optimization techniques course. It contains 58 questions related to optimization concepts like saddle points, convexity, Lagrange multipliers, penalty methods, genetic algorithms, and other numerical optimization techniques. The questions range from short-answer definitions to multi-part problems requiring the application of optimization methods to find minimum/maximum values of functions subject to various constraints.

Uploaded by

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

C U SHAH UNIVERSITY

Faculty of Technology and Engineering


M.TECH. (MECH.) SEM.-II

Subject Code: 5TE02AOT1


Subject Name: ADVANCED OPTIMIZATON TECHNIQUES
Question Bank
1.

Define a saddle point

01

2.

How do you solve a maximization problem as a minimization problem?

02

3.

Determine the following function is concave or convex f(X) = 2x13 - 6x22

02

4.

Prove that x-sin x has neither minima nor maxima

02

Determine the maximum and minimum values of the function


f (x) = 12x5 45x4 + 40x3 + 5

04

Minimize f(X) =x12+x22, subjected to: x1+x2>=4, 2x1+x2>=5, x1>=0, x2>=0 using
Kuhn-Tucker conditions.

05

The horsepower generated by a Pelton wheel is proportional to u(V u), where u is 05


the velocity of the wheel, which is variable, and V is the velocity of the jet, which is
fixed. Show that the efficiency of the Pelton wheel will be maximum when u = V /2.

Find the extreme points of the function


f (x1 , x 2) = x13 + x 23+ 2x12 + 4x22+6

Find the dimensions of a cylindrical tin (with top and bottom) made up of sheet metal 05
to maximize its volume such that the total surface area is equal to Ao=24 .

10

Write necessary and sufficient conditions for Lagrange multiplier method.


Explain with a significant example.

05

11

Give the difference between sufficient and necessary condition for single point and
multi point variable

07

12

Using Fibonacci method find an approximate value of the


function: f (x) = x2 2.6x + 2, 2 x 3 .Chose = 0.01, l = 0.2

07

13

Prove that optimization in power transmitted by spur gear pair occur where the 07
tangential load is equal to dynamic load when the criterion for the failure is scoring.
Assume dynamic load to be directly proposal to pinion speed.

04

Page 1 of 4

14

Using golden section search stopping after four iteration maximize


f (x) = 3+ 6x 4x2 on the interval[1,2]

07

15

Explain convex programming problem

02

16

What is the significance of gradient of a objective function and constraints.

02

17

Powells method is called a pattern search method justify statement.

02

18

Answer true or false: A unimodal function cannot be discontinuous.

01

19

Explain geometric programming problem.

04

20

Explain the basic approach of penalty function method.

05

21

Explain with detailed steps the procedure for the optimization using Genetic 05
Algorithm (GA).

22

Write the different application in optimizations.

04

23

Minimise : f (x1 , x 2) =1/3( x1+1)3 + x 2 subject to : g1 (x1 , x 2) = - x1 + 1<=0


g2 (x1 , x 2) = - x2 <=0 using interior penalty method.

05

24

Explain advantages and disadvantages of Genetic Algorithm (GA). And explain


how it is differ from traditional method of optimization.

05

25

Minimize: f (x1 , x 2) = x1 x 2 + 2x12 + 2x1 x2 + x22 starting with (0,0)T ,using 07


conjugate gradient method.

26

Minimize f(X) =x12+x22-2x1x2 using Steepest Decent Method starting from the 07
point (1,0).

27

Using quadric interpolation method find minimum f (X) = 2x4-x3+5x2-12x+1.carry out 07


2 iterations. Optimum lies in the range of [0, 1].

28
29

Minimize f(x) = 2x2+16/x using Newton-Rapson method.


07
Show the mathematical formulation of an optimization problem and describe 07

30
31

design vector, design constraints, and objective function with suitable example
Give the classification of Optimization problems.
04
State and prove Necessary and sufficient conditions for Unconstrained single 05

32

variable problems
Find the extreme points of function:

06

Page 2 of 4

f ( x 1 , x 2 )=x 21 + x 22+ 2 x 21 +4 x 22 +6
33

Describe how a method of langrage multiplier can solve Unconstrained 05

34

multivariable optimization problem with inequality constraints.


Show the limitations of theorem for single variable unconstraint optimization 05

35

technique.
Prove that if a Function f(x) is defined in the interval of a < x < b and has relative 05
minimum at x=x*, where a < x* < b, and if the derivative df(x)/dx =f(x) exists as

36

as finite number as x= x*, then f(x)=0


Write down the necessary & sufficient conditions for Multivariable unconstraint 04

37

optimization.
A helical spring is to carry a load of 500 kN. Formulate a problem for finding a 07
Wire diameter (d) and coil diameter (D), and number of turens (N), for minimum
weight by limiting the deflection 0.1 mm and the shear stress to 250 N/mm 2. In
addition, the natural frequency of vibration is to be greater than 100 Hz. The
stiffness of spring(k), the shear stress() and the natural frequency if vibration is
(fn) are given by:
k=

d4 G
8 D3 N

=K s

8 FD
3
d

f n=

d
2

2 2 D N

38
39
40
41
42
43

Describe the algorithms for Zoutendijks method of feasible directions.


Give the Comparison of elimination methods.
What is the basic approach for penalty function method with equality constrained?
Describe exterior penalty function method.
Prove the Convergence criterion for Interior penalty function method.
What is the procedure to follow for solving optimization problems using Genetic

03
03
04
04
04
05

44
45

Algorithms?
Define and describe Optimization as a part of Mechanical Design.
04
A cylindrical torsion bar is required to transmit 60Kw at 600 rpm. The torsional 10
stiffness is 100 N.m/degree. Using factor of safety of 1.5, design the shaft for
minimum weight. Use the following data for the materials:
Material

46
47
48
49

Mass density

y (MPa)

G (GPa)

N/mm3
St.Steel
0.11x10-3
230
84
-3
Titanium Alloy
0.06 x10
910
42
-3
Cr-Steel
0.1 x10
420
84
State five engineering applications of optimization.
Define saddle point and bounded Hessian matrix.
State the relationship between Golden ratio and Fibonacci sequence.
What do you understand by penalty method? Which are the different penalty
Page 3 of 4

02
02
02
03

50

Function methods? Explain any one in detail


3
x
Minimize f (x) =2x1-1 x2-1 + 2 2-2 + 2x1x2

by Geometric Programming

04

51

Technique
What is the Hessian matrix for f(x) = x12+(x1+x2)2+(x1+x3)2.Also determine local 05

52

extrema.
Determine whether the given function is convex or concave:

53

f (x,y,z)=4x2+3y2+5z2+6xy+xz-3x-2y+15
Find the dimensions of a cylindrical tin (with top and bottom) made up of sheet 07

03

metal to maximize its volume such that the total surface is equal to A 0=24 .
54

What is the significance of gradient of an objective function and constraints? What 04

55

is gradient vector? State the properties of gradient vector.


Consider the minimization of the objective function f = x 5 5x3 20x + 5 Carry 07
out two iterations, using quadratic interpolation method with initial interval of

56

uncertainty [0,5]. Use polynomial f (x) = a0 + a1 x + a2x2 .


Minimize f(x) =x12+x22+60 x1 subject to the constraints g1=x1-80 0 , g2=x1+x2- 07

57

120 0. Using Kuhn Tucker Conditions.


Minimise f(x) = x12+x22+x32 subject to constraints x1+2x2+3x3=7, 2x1+2x2+x3=9/2 07

58

using Lagranges Multipliers.


Minimize f (x) =x2-sin x, [0,1] correct to an interval accuracy of 0.1 using Golden 07
Section Method.

Page 4 of 4

You might also like