Lagrange multipliers: How do I know if its a max of min

Click For Summary
SUMMARY

The discussion focuses on determining whether extrema found using Lagrange multipliers are maxima or minima. In the case of the function f(x,y) = x² + y² with the constraint xy = 1, the local extremum is identified as a minimum at the value of 2. Conversely, for the function f(x1, x2, ..., xn) = x1 + x2 + ... + xn subject to the constraint (x1)² + ... + (xn)² = 1, the extremum is a maximum at sqrt(n). The analysis emphasizes that if only one extremum exists, one must evaluate values near that extremum to ascertain its nature. Additionally, the objective function is confirmed to be convex, ensuring that any local minimum is also a global minimum.

PREREQUISITES
  • Understanding of Lagrange multipliers
  • Knowledge of convex functions and their properties
  • Familiarity with Hessian matrices
  • Basic calculus concepts including local and global extrema
NEXT STEPS
  • Study the properties of convex functions in optimization
  • Learn how to compute the Hessian matrix for multivariable functions
  • Explore advanced applications of Lagrange multipliers in constrained optimization
  • Investigate the implications of bounded and unbounded functions in optimization problems
USEFUL FOR

Students and professionals in mathematics, particularly those studying optimization, calculus, and mathematical analysis, will benefit from this discussion.

freshman2013
Messages
43
Reaction score
0
in the problem f(x,y)=x^2+y^2 and xy=1, I get 2 as a local extrema and it is a min
in the problem f(x1,x2...xn) = x1+x2..+xn (x1)^2+...(xn)^2=1 I get sqrt(n) and its a max. How do I know if these are max or min values? If I get more than two extrema, I just compare them and one's a max and the other's min. What if there's only one?
 
Physics news on Phys.org
Then look at values close to that extremum.
 
1) The objective ##f## is bounded below (since ##f\geq 0##) but not above (since ##f\left(x,\frac1x\right) = x^2 +
\frac1{x^2}\geq x^2 \to \infty## as ##x\to \infty##). So it may be possible to have a global minimum in the constraint set, but you'll never find a global maximum.

2) The objective is convex (which follows either from using the triangle inequality or from computing the Hessian), so that any local minimum in the convex set ##\{(x,y):\enspace x,y\geq0, \enspace xy\geq 1\}## is a global minimum.
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K