Definition:Lagrange multiplier

This article needs to be tidied. In particular: Please attempt to get to grips with house style Please fix formatting and $\LaTeX$ errors and inconsistencies. It may also need to be brought up to our standard house style. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Tidy}} from the code.

It has been suggested that this page or section be merged into Definition:Lagrange's Method of Multipliers/Lagrange Multiplier. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Mergeto}} from the code.

This article needs to be linked to other articles. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by adding these links. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{MissingLinks}} from the code.

The Lagrange multiplier method is used when one needs to find the extreme or stationary points of a function on a set which is a subset of the domain.

Method

Suppose that $f(\mathbf{x})$ and $g_{i}(\mathbf{x}), i=1,...,m$ ($\mathbf{x}\in \R^n$) are differentiable functions that map $\R^n \mapsto \R$, and we want to solve

$\min f(\mathbf{x}), \max f(\mathbf{x})\quad\mbox{such that}\quad g_{i}(\mathbf{x})=0,\quad i=1,\ldots,m$

By a Lagrange multiplier theorem, if the constaints are independent, the gradient of $f$, $\nabla f$, must satisfy the following equation at the stationary points:

$\nabla f = \sum_{i=1}^{m} \lambda_{i} \nabla g_{i}$

The constraints are said to be independent iff all the gradients of each constraint are linearly independent, that is:

$\left \{\nabla g_{1}(\mathbf{x}), \ldots, \nabla g_{m}(\mathbf{x})\right \}$ is a set of linearly independent vectors on all points where the constraints are verified.

Note that this is equivalent to finding the stationary points of:

$f(\mathbf{x})-\sum_{i=1}^{m} \lambda_{i}( g_{i}(\mathbf{x}))$

for $\mathbf{x}$ in the domain and the Lagrange multipliers $\lambda_{i}$ without restrictions.

After finding those points, one applies the $g_i$ constraints to get the actual stationary points subject to the constraints.

Source

• This article incorporates material from Lagrange multiplier method on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.