Question-1 (Lagriagian Multipliers)

Duration: 16 min

This video lesson is available to enrolled students.

Enroll to watch — Coal India Management Trainee (CS) Recruitment 2026

AI Summary

An AI-generated summary of this video lecture.

This video presents a step-by-step solution to a non-linear programming problem using the method of Lagrange multipliers. The instructor begins by writing the problem: minimize the function z = k * x^1 * y^2 subject to the constraint x^2 + y^2 = a^2. He then introduces the Lagrangian function L(x, y, λ) = f(x, y) + λ * h(x, y), where f is the objective function and h is the constraint function. The core of the solution involves setting the partial derivatives of the Lagrangian with respect to x, y, and λ equal to zero, which yields a system of three equations. The instructor proceeds to solve this system algebraically, first finding a relationship between x and y (y^2 = 2x^2), then substituting back into the constraint to find the values of x and y. Finally, he substitutes these values into the objective function to find the minimum value of z, which is z = 3√3 * k.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a whiteboard displaying the title 'Linear Programming Problem' and 'Non-Linear programming problem'. The instructor begins by writing the problem statement: 'Obtain set of necessary condition' for minimizing z = k * x^1 * y^2 subject to the constraint x^2 + y^2 = a^2, with x, y ≥ 0. He introduces the concept of necessary conditions for optimization, specifically mentioning the 'Lagrange Multiplier' method.

  2. 2:00 – 5:00 02:00-05:00

    The instructor writes the solution process. He defines the objective function f(x, y) = k * x * y^2 and the constraint function h(x, y) = x^2 + y^2 - a^2. He then constructs the Lagrangian function L(x, y, λ) = f(x, y) + λ * h(x, y), which becomes L(x, y, λ) = k * x * y^2 + λ * (x^2 + y^2 - a^2). He explains that the necessary conditions are found by setting the partial derivatives of L with respect to x, y, and λ to zero.

  3. 5:00 – 10:00 05:00-10:00

    The instructor writes the three necessary conditions derived from the partial derivatives: ∂L/∂x = 0, ∂L/∂y = 0, and ∂L/∂λ = 0. These equations are: -k * x^(-2) * y^2 + 2λx = 0, -2k * x^(-1) * y^3 + 2λy = 0, and x^2 + y^2 - a^2 = 0. He simplifies the first two equations to 2λx = k * x^(-2) * y^2 and 2λy = 2k * x^(-1) * y^3. By dividing the first equation by the second, he eliminates λ and obtains the relationship y^2 = 2x^2.

  4. 10:00 – 15:00 10:00-15:00

    With the relationship y^2 = 2x^2, the instructor substitutes it into the constraint equation x^2 + y^2 = a^2. This gives x^2 + 2x^2 = a^2, which simplifies to 3x^2 = a^2. Solving for x, he finds x = a / √3. Substituting this back into y^2 = 2x^2, he finds y^2 = 2 * (a^2 / 3) = 2a^2 / 3, so y = a * √(2/3). He then writes the final step: 'Putting x = a/√3, y = a√(2/3) in z = kxy^2'.

  5. 15:00 – 15:35 15:00-15:35

    The instructor completes the calculation. He substitutes the values of x and y into the objective function z = k * x * y^2. This results in z = k * (a/√3) * (2a^2/3) = (2k * a^3) / (3√3). He then rationalizes the denominator to get the final answer: z = (2k * a^3 * √3) / 9, which he simplifies to z = 3√3 * k. The video ends with the final answer written on the board.

The video provides a clear, structured demonstration of solving a constrained optimization problem using the Lagrange multiplier method. It begins by defining the problem and the necessary conditions, then systematically derives the Lagrangian and its partial derivatives. The solution process is shown in a logical sequence: eliminating the multiplier λ to find a relationship between variables, substituting into the constraint to solve for the variables, and finally evaluating the objective function. The key takeaway is the application of the Lagrangian method to find the minimum of a non-linear function subject to a non-linear constraint.