JNTU

JNTU B.Tech IV OPTIMIZATION TECHNIQUES IN ENGINEERING Previous Question Paper (July/August - 2022 - R16)

B.Tech | IV | II | R16 | July/August - 2022

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

Answer any five questions. All questions carry equal marks.

Main

1

Find the minimum of the function

f = λ/log λ
take the initial trail step length as 0.1 by using Quadratic interpolation method.

15 marks

Answer

To find the minimum of the function f(λ) = λ / log(λ) using quadratic interpolation, we define the objective function f(λ) = λ / ln(λ). Given the initial trial step length Δλ = 0.1, we start at an initial point λ₀ = 2 (since ln(λ) must be positive and λ > 1 for the function to be defined).

Step 1: Evaluate the function at three points to perform the first interpolation.

λ₀ = 2.0, f(λ₀) = 2 / ln(2) ≈ 2.8854
λ₁ = λ₀ + Δλ = 2.1, f(λ₁) = 2.1 / ln(2.1) ≈ 2.8624
λ₂ = λ₁ + Δλ = 2.2, f(λ₂) = 2.2 / ln(2.2) ≈ 2.8530

Step 2: Use the quadratic interpolation formula to find the stationary point λ*:

λ* = 0.5 * [f(λ₀)(λ₁² - λ₂²) + f(λ₁)(λ₂² - λ₀²) + f(λ₂)(λ₀² - λ₁²)] / [f(λ₀)(λ₁ - λ₂) + f(λ₁)(λ₂ - λ₀) + f(λ₂)(λ₀ - λ₁)]

Substituting the values:

λ* = 0.5 * [2.8854(4.41 - 4.84) + 2.8624(4.84 - 4.0) + 2.8530(4.0 - 4.41)] / [2.8854(2.1 - 2.2) + 2.8624(2.2 - 2.0) + 2.8530(2.0 - 2.1)]
λ* = 0.5 * [-1.2407 + 2.4044 - 1.1697] / [-0.2885 + 0.5725 - 0.2853]
λ* = 0.5 * [-0.006] / [-0.0013] ≈ 2.3077

Step 3: Verify the minimum. The derivative f'(λ) = (ln(λ) - 1) / (ln(λ))². Setting f'(λ) = 0 gives ln(λ) = 1, which implies λ = e ≈ 2.718. The quadratic interpolation method converges iteratively toward this value. Repeating the process with the new point λ* will refine the estimate toward the global minimum at λ = e.

2

Minimize

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

15 marks

Answer

To minimize the function f(λ) = λ5 - 5λ3 - 20λ + 5 using the quadratic interpolation method, we iteratively approximate the function with a quadratic polynomial P(λ) = a0 + a1λ + a2λ2 and find its minimum at λ* = -a1 / (2a2).

Let us choose initial points λ0 = 0, λ1 = 1, and λ2 = 2. The function values are:

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

Using the quadratic interpolation formula for three points, the minimum λ* is given by:

λ* = 0.5 * [f(λ0)(λ12 - λ22) + f(λ1)(λ22 - λ02) + f(λ2)(λ02 - λ12)] / [f(λ0)(λ1 - λ2) + f(λ1)(λ2 - λ0) + f(λ2)(λ0 - λ1)]

Substituting the values:

Numerator = 0.5 * [5(1 - 4) + (-19)(4 - 0) + (-43)(0 - 1)] = 0.5 * [-15 - 76 + 43] = -24
Denominator = [5(1 - 2) + (-19)(2 - 0) + (-43)(0 - 1)] = [-5 - 38 + 43] = 0

Since the denominator is zero, the points are collinear, indicating the quadratic approximation is not suitable for these initial points. Choosing new points λ0 = 1, λ1 = 2, λ2 = 3:

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

Applying the formula again:

Numerator = 0.5 * [-19(4 - 9) + (-43)(9 - 1) + 53(1 - 4)] = 0.5 * [95 - 344 - 159] = -204
Denominator = [-19(2 - 3) + (-43)(3 - 1) + 53(1 - 2)] = [19 - 86 - 53] = -120
λ* = -204 / -120 = 1.7

The process is repeated by replacing the point with the highest function value with λ* until the desired convergence is achieved. For this function, the analytical minimum occurs where f'(λ) = 5λ4 - 15λ2 - 20 = 0. Letting x = λ2, we get x2 - 3x - 4 = 0, giving x = 4 (λ = 2) or x = -1 (imaginary). The quadratic interpolation method converges to this value of λ = 2.

3

Solve the following equations using the steepest descent method (two iterations only) with the starting point, X1 =

2x1 + x2 = 4, x1 + 2x2 + x3 = 8, x2 + 3x3 = 11.

15 marks

Answer

Sign in to view the complete answer paper.

4

Minimize

f(x1, x2) = x1 - x2 + 2x12 + 2x1x2 + x22
from the starting point X1 using Powell’s method.

15 marks

Answer

Sign in to view the complete answer paper.

5

If

x1 = 2, x2 = 3, x3 = 1
be the feasible solution of linear programming problem: Maximize
Z = x1 + 2x2 + 4x3
, subject to
2x1 + x2 + 4x3 = 11, 3x1 + x2 + 5x3 = 14, x1, x2, x3 ≥ 0
, then find the optimal solution from the given feasible solution.

15 marks

Answer

Sign in to view the complete answer paper.

6

Solve the problem: Minimize

z = x1 + x2
, subject to
2x1 + x2 ≥ 4, x1 + 7x2 ≥ 7
and
x1, x2 ≥ 0
by using the artificial variable technique.

15 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Explain the cutting plane method of solving an integer problem.

7 marks

Answer

Sign in to view the complete answer paper.

b

Explain the algorithm involved in the iterative solution to all integer programming problem.

8 marks

Answer

Sign in to view the complete answer paper.

8

Minimize

f(x) = x1-2 + 0.25x22x3
subjected to
0.75x12x2-2 + (3/8)x2x3-2 ≤ 1, xi > 0, i = 1, 2, 3
by using geometric programming.

15 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 II, July/August - 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...