Example Convex Function

Duration: 25 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 is a comprehensive lecture on solving a non-linear programming problem using the method of Lagrange multipliers. The instructor begins by presenting a maximization problem with a quadratic objective function and a linear constraint. He then introduces the Lagrangian function, L(x1, x2, λ) = f(x1, x2) - λ * h(x1, x2), which combines the objective and the constraint. The core of the solution involves setting the partial derivatives of the Lagrangian with respect to x1, x2, and λ to zero, resulting in a system of three equations. The instructor proceeds to solve this system, finding the critical point at x1 = 3.5, x2 = 3, and λ = 0.4. To confirm that this point is a maximum, he analyzes the Hessian matrix of the objective function, showing that it is negative definite, which implies the function is concave. The lecture concludes by calculating the maximum value of the objective function, which is 10.7, and summarizing the conditions for a necessary and sufficient solution.

Chapters

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

    The video opens with a title, "Linear Programming Problem," which is immediately crossed out and replaced with "Non Linear Programming." The instructor begins by writing the problem statement: Maximize Z = 3.6x1 - 0.4x1^2 + 1.6x2 - 0.2x2^2, subject to the constraint 2x1 + x2 = 10, with x1, x2 ≥ 0. He then introduces the concept of the Lagrangian function, L(x1, x2, λ) = f(x1, x2) - λ * h(x1, x2), to solve this constrained optimization problem.

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

    The instructor writes the Lagrangian function: L(x1, x2, λ) = 3.6x1 - 0.4x1^2 + 1.6x2 - 0.2x2^2 - λ(2x1 + x2 - 10). He then derives the necessary conditions for a maximum by setting the partial derivatives of L with respect to x1, x2, and λ to zero. This results in the first-order conditions: ∂L/∂x1 = 3.6 - 0.8x1 - 2λ = 0, ∂L/∂x2 = 1.6 - 0.4x2 - λ = 0, and ∂L/∂λ = -(2x1 + x2 - 10) = 0.

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

    The instructor begins solving the system of three equations derived from the first-order conditions. He isolates λ from the second equation, getting λ = 1.6 - 0.4x2, and substitutes it into the first equation, resulting in 3.6 - 0.8x1 - 2(1.6 - 0.4x2) = 0. He simplifies this to 0.4 = 0.8x1 - 0.8x2, which further simplifies to x1 - x2 = 0.5. He then uses the constraint equation 2x1 + x2 = 10 to solve for x1 and x2.

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

    The instructor solves the system of equations. From x1 - x2 = 0.5, he gets x1 = x2 + 0.5. Substituting this into the constraint 2x1 + x2 = 10 gives 2(x2 + 0.5) + x2 = 10, which simplifies to 3x2 + 1 = 10, leading to x2 = 3. Substituting back, he finds x1 = 3.5. He then calculates λ = 1.6 - 0.4(3) = 0.4. The critical point is (3.5, 3) with λ = 0.4.

  5. 15:00 – 20:00 15:00-20:00

    To verify that the critical point is a maximum, the instructor analyzes the concavity of the objective function f(x1, x2). He calculates the Hessian matrix H, which consists of the second partial derivatives: ∂²f/∂x1² = -0.8, ∂²f/∂x2² = -0.4, and ∂²f/∂x1∂x2 = 0. He states that since the Hessian is negative definite (all principal minors are negative), the function is concave, and thus the necessary condition is also sufficient for a maximum.

  6. 20:00 – 25:00 20:00-25:00

    The instructor calculates the maximum value of the objective function by substituting the optimal values x1 = 3.5 and x2 = 3 into the original function: Z = 3.6(3.5) - 0.4(3.5)^2 + 1.6(3) - 0.2(3)^2. He performs the calculation step-by-step, resulting in Z = 12.6 - 4.9 + 4.8 - 1.8 = 10.7. He concludes that the maximum value is 10.7.

  7. 25:00 – 25:19 25:00-25:19

    The instructor summarizes the key points. He reiterates that for a maximization problem with a single constraint, if the objective function is concave, then the necessary condition (first-order conditions) becomes a sufficient condition for a global maximum. He writes a remark on the board: "The necessary condition becomes sufficient condition for maximum (minimum) of objective function if f is concave (convex)."

This video provides a complete, step-by-step demonstration of solving a non-linear programming problem. It begins by formulating the problem and introducing the Lagrangian method. The core of the solution involves deriving and solving a system of equations from the first-order conditions. The instructor then rigorously verifies the nature of the critical point by analyzing the concavity of the objective function using the Hessian matrix. The final step is to compute the maximum value of the function at the optimal point. The synthesis highlights the crucial link between the mathematical conditions and the economic or physical interpretation: a concave objective function guarantees that a local maximum found via the Lagrangian method is the global maximum.