JNTU
JNTU B.Tech IV OPTIMIZATION TECHNIQUES IN ENGINEERING Previous Question Paper (July/August - 2022 - R16)
Answer any five questions. All questions carry equal marks.
Main
Find the minimum of the function
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.
Step 2: Use the quadratic interpolation formula to find the stationary point λ*:
Substituting the values:
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.
Minimize
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:
Using the quadratic interpolation formula for three points, the minimum λ* is given by:
Substituting the values:
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:
Applying the formula again:
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.
Solve the following equations using the steepest descent method (two iterations only) with the starting point, X1 =
Answer
Sign in to view the complete answer paper.
Minimize
Answer
Sign in to view the complete answer paper.
If
Answer
Sign in to view the complete answer paper.
Solve the problem: Minimize
Answer
Sign in to view the complete answer paper.
Explain the cutting plane method of solving an integer problem.
Answer
Sign in to view the complete answer paper.
Explain the algorithm involved in the iterative solution to all integer programming problem.
Answer
Sign in to view the complete answer paper.
Minimize
Answer
Sign in to view the complete answer paper.