Optimization with Constraints: Solving Classic Problems Using Lagrange Multipliers

Optimization with Constraints: Three Classic Problems Solved

In this post, we'll explore three optimization problems using Lagrange multipliers to find extrema (minimum or maximum values) of functions subject to constraints. This is a core concept in multivariable calculus and a powerful tool in applied mathematics.

1. Finding the Minimum and Maximum of

\[ f(x,y,z)=xy+yz \]

Subject to: \[ x^2+y^2+z^2=1 \] (the unit sphere)

To tackle this, we use the method of Lagrange multipliers. Let the constraint function be: \[g(x,y,z)= x^2+y^2+z^2-1=0 \]

We solve \[ \nabla f = \lambda \nabla g \]

This problem demonstrates optimizing a function over a unit sphere. The solutions give extremum points where the gradient of the function aligns with the constraint surface.

2. Finding the Minimum and Maximum of

\[ f(x_1,x_2)=x_1x_2 \]

Subject to: \[ 2x_1+3x_2=4 \]

To tackle this, we use the method of Lagrange multipliers. Let the constraint function be:

\[ g(x_1,x_2)=2x_1+3x_2-4=0\]

Apply Lagrange multipliers:

This problem involves a linear constraint, and the graphical method using level sets helps intuitively verify the extremum point.

3. Finding the Minimum and Maximum of

\[ f(x_1,x_2,x_3)=x^2_1-2x_1+x^2_2-x^2_3 +4x_3\]

Subject to: \[ x_1-x_2+2x_3=2 \]

To tackle this, we use the method of Lagrange multipliers. Let the constraint function be:

\[ g(x_1,x_2,x_3)=x_1-x_2+2x_3-2=0\]

Apply Lagrange multipliers:

This problem involves a nonlinear function and constraint. Using SageMath's symbolic solver, we find the critical points satisfying the constraint and evaluate the function at those points to determine the extrema.

Because the function is quadratic and the constraint is linear, this is likely a local extremum, but further analysis (e.g., using the bordered Hessian) would be needed to determine if it's a minimum or maximum. Based on behavior at infinity, the function appears unbounded above and below on the constraint surface.

Notes:

• The code uses list comprehensions and solution_dict = True for cleaner access to variables.
• Visualizations are wrapped in try-except blocks to avoid crashes if 3D plotting isn't available.
• Each problem is clearly separated for readability.