JNTU
JNTU B.Tech IV Year OPTIMIZATION TECHNIQUES IN ENGINEERING Previous Question Paper (September - 2022 - R16)
Answer any five questions
All questions carry equal marks
Main
Find the maximum of function for the following equation by the Golden section method with n=8
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:
- Set initial interval [a, b] = [0, 2].
- Calculate interior points: λ1 = b - φ(b - a) and λ2 = a + φ(b - a).
- Evaluate f(λ1) and f(λ2).
- For maximization, if f(λ1) < f(λ2), the new interval is [λ1, b]. If f(λ1) > f(λ2), the new interval is [a, λ2].
- 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.
Minimize f = λ5 - 5λ3 - 20λ + 5 using quadratic interpolation method.
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:
2. The quadratic passing through (λ1, f1), (λ2, f2), and (λ3, f3) is given by:
Substituting the values:
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:
4. Calculate coefficients for P(λ) = a0 + a1λ + a2λ2:
5. Find the minimum:
The estimated minimum is at λ = 1.7. Further iterations would refine this value toward the true minimum.
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.
Answer
Sign in to view the complete answer paper.
Using Hook-Jeeves, minimize f = 50 + (2.71 - X1)2 - (1 - X2)2 by starting point at (0.5, 0).
Answer
Sign in to view the complete answer paper.
Solve the LPP. Minimize Z = 2x1 + 3x2 + 4x3 Subject to x1 - x2 + x3 = 0, x1 + x2 + x3 = 2, x1, x2, x3 ≥ 0.
Answer
Sign in to view the complete answer paper.
What do you mean by two-phase method in linear programming problems, why it is used?
Answer
Sign in to view the complete answer paper.
Explain the significance of artificial variables in simplex method.
Answer
Sign in to view the complete answer paper.
Solve the integer programming problem. Max Z = 7x1 + 9x2, subject to -x1 + 3x2 ≤ 6, 7x1 + x2 ≤ 35, x1 ≥ 0, x2 ≥ 0, and integers.
Answer
Sign in to view the complete answer paper.
Explain the working principles and their similarities in genetic algorithm.
Answer
Sign in to view the complete answer paper.
Explain the differences between the genetic algorithm and traditional methods.
Answer
Sign in to view the complete answer paper.