1. Consider minimizing $f(x,y,z) = x + 2y + 3z$ subject to both $x^2 + y^2 = 1$ and $y + z = 1$. How many Lagrange multipliers are needed, and what system must be solved?
- A.One multiplier: $\nabla f = \lambda \nabla g_1$ with $g_1 = 0$ and $g_2 = 0$
- B.Two multipliers: $\nabla f = \lambda_1 \nabla g_1 + \lambda_2 \nabla g_2$ with $g_1 = 0$ and $g_2 = 0$
- C.Two multipliers: $\nabla f = \lambda_1 \nabla g_1$ and $\nabla f = \lambda_2 \nabla g_2$ separately
- D.No multipliers are needed; substitute the constraints directly into $f$
View Answer
Answer: Two multipliers: $\nabla f = \lambda_1 \nabla g_1 + \lambda_2 \nabla g_2$ with $g_1 = 0$ and $g_2 = 0$
Multiple constraints require multiple multipliers: With $k$ constraints, the Lagrange condition is $\nabla f = \lambda_1 \nabla g_1 + \lambda_2 \nabla g_2 + \cdots + \lambda_k \nabla g_k$, along with all constraint equations. Why the correct answer works: With two constraints, we need two multipliers and the system $\nabla f = \lambda_1 \nabla g_1 + \lambda_2 \nabla g_2$, plus $g_1 = 0$ and $g_2 = 0$. Why distractors fail: Option A uses only one multiplier, which is insufficient. Option C incorrectly sets up two separate equations rather than a linear combination. Option D suggests direct substitution, which works in some cases but does not answer the question about the Lagrange multiplier method.