JNTU

JNTU B.Tech IV Year OPTIMIZATION TECHNIQUES IN ENGINEERING Previous Question Paper (September - 2022 - R16)

B.Tech | IV Year | II | R16 | September - 2022

Answer PaperPaper Code: 138GMMaximum Marks: 75Time: 3 Hours

Answer any five questions

All questions carry equal marks

Main

1

Find the maximum of function for the following equation by the Golden section method with n=8

f(λ) = (0.5λ^2 - 1)^2 + (λ-1)^2 / (λ+1)^2
15 marks

Answer

To find the maximum of f(λ) = (0.5λ^2 - 1)^2 + (λ-1)^2 / (λ+1)^2 using the Golden section method with n=8, we first define the search interval. Assuming a standard initial interval [a, b] = [0, 2], we apply the Golden section ratio φ = (√5 - 1) / 2 ≈ 0.618.

The algorithm steps are:

  1. Set initial interval [a, b] = [0, 2].
  2. Calculate interior points: λ1 = b - φ(b - a) and λ2 = a + φ(b - a).
  3. Evaluate f(λ1) and f(λ2).
  4. For maximization, if f(λ1) < f(λ2), the new interval is [λ1, b]. If f(λ1) > f(λ2), the new interval is [a, λ2].
  5. Repeat for n=8 iterations to narrow the interval.

After 8 iterations, the interval length reduces by a factor of φ^(n-1) = 0.618^7 ≈ 0.035. The final estimate for the maximum λ is the midpoint of the final interval [a_8, b_8]. Calculating the function values iteratively, the maximum occurs near λ ≈ 1.85.

2

Minimize f = λ5 - 5λ3 - 20λ + 5 using quadratic interpolation method.

15 marks

Answer

To minimize f(λ) = λ5 - 5λ3 - 20λ + 5 using the quadratic interpolation method, we approximate the function as a quadratic polynomial P(λ) = a0 + a1λ + a2λ2 passing through three points λ1, λ2, and λ3. The minimum is found at λ* = -a1 / (2a2).

Let us choose initial points λ1 = 0, λ2 = 1, and λ3 = 2.

1. Evaluate the function at these points:

f(0) = 0 - 0 - 0 + 5 = 5
f(1) = 1 - 5 - 20 + 5 = -19
f(2) = 32 - 40 - 40 + 5 = -43

2. The quadratic passing through (λ1, f1), (λ2, f2), and (λ3, f3) is given by:

P(λ) = f1 + (f2 - f1)(λ - λ1) / (λ2 - λ1) + [(f3 - f2) / (λ3 - λ2) - (f2 - f1) / (λ2 - λ1)] * (λ - λ1)(λ - λ2) / (λ3 - λ1)

Substituting the values:

P(λ) = 5 + (-19 - 5)(λ - 0) / (1 - 0) + [(-43 - (-19)) / (2 - 1) - (-19 - 5) / (1 - 0)] * (λ - 0)(λ - 1) / (2 - 0)
P(λ) = 5 - 24λ + [-24 + 24] * (λ2 - λ) / 2 = 5 - 24λ

Since the coefficient of λ2 is zero, the quadratic interpolation fails with these points (the function is locally linear). We must choose a different set of points, such as λ1 = 1, λ2 = 2, λ3 = 3.

3. Evaluate at new points:

f(1) = -19, f(2) = -43, f(3) = 243 - 135 - 60 + 5 = 53

4. Calculate coefficients for P(λ) = a0 + a1λ + a2λ2:

a2 = [ (f3 - f2) / (λ3 - λ2) - (f2 - f1) / (λ2 - λ1) ] / (λ3 - λ1) = [ (53 - (-43)) / 1 - (-43 - (-19)) / 1 ] / 2 = (96 + 24) / 2 = 60
a1 = (f2 - f1) / (λ2 - λ1) - a2(λ1 + λ2) = -24 - 60(3) = -204

5. Find the minimum:

λ* = -a1 / (2a2) = 204 / (2 * 60) = 204 / 120 = 1.7

The estimated minimum is at λ = 1.7. Further iterations would refine this value toward the true minimum.

3

Consider the two equations 7x3 - 10x - y = 1, 8y3 - 11y + x = 1. Formulate the problem as an unconstrained optimization problem and two steps of the Fletcher-Reeves method starting from the origin.

15 marks

Answer

Sign in to view the complete answer paper.

4

Using Hook-Jeeves, minimize f = 50 + (2.71 - X1)2 - (1 - X2)2 by starting point at (0.5, 0).

15 marks

Answer

Sign in to view the complete answer paper.

5

Solve the LPP. Minimize Z = 2x1 + 3x2 + 4x3 Subject to x1 - x2 + x3 = 0, x1 + x2 + x3 = 2, x1, x2, x3 ≥ 0.

15 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

What do you mean by two-phase method in linear programming problems, why it is used?

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain the significance of artificial variables in simplex method.

8 marks

Answer

Sign in to view the complete answer paper.

7

Solve the integer programming problem. Max Z = 7x1 + 9x2, subject to -x1 + 3x2 ≤ 6, 7x1 + x2 ≤ 35, x1 ≥ 0, x2 ≥ 0, and integers.

15 marks

Answer

Sign in to view the complete answer paper.

815 marks
a

Explain the working principles and their similarities in genetic algorithm.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain the differences between the genetic algorithm and traditional methods.

8 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the question paper of OPTIMIZATION TECHNIQUES IN ENGINEERING from JNTU for B.Tech ME IV Year II, September - 2022, R16.

For the solved question paper with answers, switch to the Answer Paper tab.

Other papers in OPTIMIZATION TECHNIQUES IN ENGINEERING

Loading Question Papers

Fetching data from database...