Lagrange Multipliers — Question 6

PDF ↗

Question 6

Consider maximizing and minimizing f(x,y)=xf(x,y)=x subject to the constraint g(x,y)=x2+y2=0.g(x,y)=x^2+y^2=0.

Tasks

  1. Determine the feasible set and its constrained extrema directly.

  2. Show that no multiplier λ\lambda satisfies ∇f=λ∇g\nabla f=\lambda\nabla g at the feasible point.

  3. Explain which constraint-qualification hypothesis fails and why this does not contradict the method.

Original worksheet page 1: question and worked solution for 3-5-006
Show solutionHide solution

Question 6 – Solution

Strategy. Inspect the feasible set before applying the multiplier equation; the constraint has a singular gradient at its only point.

Step 1: Direct analysis The equation x2+y2=0x^2+y^2=0 over the reals forces x=0,y=0.x=0,\qquad y=0. Thus the feasible set is the singleton {(0,0)}\{(0,0)\}. Its only function value is 00, so fmin=fmax=0 at (0,0).\boxed{f_{\min}=f_{\max}=0\text{ at }(0,0)}.

Step 2: Multiplier failure ∇f(0,0)=⟨1,0⟩,∇g(0,0)=⟨0,0⟩.\nabla f(0,0)=\left\langle 1,0\right\rangle, \qquad \nabla g(0,0)=\left\langle 0,0\right\rangle. The equation ⟨1,0⟩=λ⟨0,0⟩\left\langle 1,0\right\rangle=\lambda\left\langle 0,0\right\rangle has no solution for any real λ\lambda.

Step 3: Interpretation The standard Lagrange multiplier theorem assumes ∇g≠𝟎\nabla g\ne\mathbf 0 at the constrained extremum. That regularity condition fails here, so the theorem makes no promise. The example shows that singular feasible points must be checked separately; it does not invalidate the multiplier method at regular constraint points.

Original worksheet page 2: question and worked solution for 3-5-006

Original worksheet layout. Use Enlarge or open the PDF for a closer view.