1. **Stating the problem:** Optimization problems involve finding the maximum or minimum values of a function, often subject to certain constraints. 2. **Key formulas and concepts:** - Objective function: The function $f(x)$ or $f(x,y)$ to be maximized or minimized. - Critical points: Points where the derivative(s) equal zero or do not exist. - First derivative test: Solve $f'(x) = 0$ to find critical points. - Second derivative test: Use $f''(x)$ to determine concavity and classify critical points. - For functions of two variables, use partial derivatives $f_x = 0$, $f_y = 0$ to find critical points. - Use the Hessian matrix $H = \begin{bmatrix} f_{xx} & f_{xy} \\ f_{yx} & f_{yy} \end{bmatrix}$ and its determinant $D = f_{xx}f_{yy} - (f_{xy})^2$ to classify critical points: - If $D > 0$ and $f_{xx} > 0$, local minimum. - If $D > 0$ and $f_{xx} < 0$, local maximum. - If $D < 0$, saddle point. - If $D = 0$, test is inconclusive. 3. **Constraints:** - Use Lagrange multipliers for constrained optimization: solve $\nabla f = \lambda \nabla g$ where $g(x,y,...) = 0$ is the constraint. 4. **Summary of steps:** - Define the objective function. - Find derivatives or partial derivatives. - Solve for critical points. - Use second derivative test or Hessian to classify. - Check boundary or constraint conditions if any. This collection of formulas and rules covers the main tools used in optimization problems.