Roll No.

: _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

Amrita Vishwa Vidyapeetham

Amrita School of Engineering, Coimbatore
B.Tech. First Assessment Examinations – January 2019
Sixth Semester
Electrical and Electronic Engineering

15MAT303 Optimization Techniques

[Time: Two hours Maximum: 50 Marks]
CO Course Outcomes
CO01 Understand different types of Optimization Techniques in engineering problems. Learn
Optimization methods such as Bracketing methods, Region elimination methods, Point
estimation methods.
CO02 Learn gradient based Optimizations Techniques in single variables as well as multivariable
(non-linear).
CO03 Understand the Optimality criteria for functions in several variables and learn to apply OT
methods like unidirectional search and direct search methods.
CO04 Learn constrained optimization techniques. Learn to verify Kuhn-Tucker conditions and
Lagrangian Method.
Answer all questions
𝐏𝐀𝐑𝐓 𝐀 (𝟓 × 𝟐 = 𝟏𝟎 𝑴𝒂𝒓𝒌𝒔)
1. Write the fundamental rule for region elimination method of single variable [CO01]
optimization problem.
2. Write the difference between exhaustive search method and bounding phase method. [CO01]
3. If (1,55), (2,31) and (3,27) are three points on the general quadratic function, then [CO01]
find 𝑎0 , 𝑎1 , 𝑎2 and 𝑥̅ .

4. Define unimodal function and give an example. [CO01]

5. Write the algorithm of Interval halving method. [CO01]

𝐏𝐀𝐑𝐓 𝐁 (𝟒 × 𝟏𝟎 = 𝟒𝟎 𝑴𝒂𝒓𝒌𝒔)
3 2
6. Bracket the minimum for the function 𝑓(𝑥) = 𝑥 − 6𝑥 + 9𝑥 + 6 on (0,4) using [CO01]
Golden section search method. (Do four iterations)
7. Perform four iterations of the exhaustive search method to minimize the function [CO01]
𝑓(𝑥) = 𝑥 2 + 2𝑥, 𝑥 ∈ (−2,4) with 𝑛 = 10.
8. Use two iterations of the successive quadratic estimation method to minimize the [CO01]
single variable function 𝑓(𝑥) = 2𝑒 𝑥 − 𝑥 3 − 10𝑥 with initial point 𝑥1 = 1 and ∆= 1.

9. (a) Determine optimum function values of the function 𝑓(𝑥) = 12𝑥 5 − 45𝑥 4 + [CO01]
40𝑥 3 + 5.
(b) State the necessary and sufficient conditions for the optimum values of the single
variable optimization function.

*******

Page 1 of 1