# First-order conditions

This descends from classical optimization, using Taylor's Theorem. For unconstrained optimization, this is simply that $LaTeX: \nabla f(x*) = 0$. (In variational calculus, it is the Euler-Lagrange equation.) For constrained optimization, the first-order conditions of a regular mathematical program is given by the Lagrange Multiplier Rule.