Operations research, mathematical programming Theorem
Lagrange multipliers
Builds on Constrained optimisationLocal maximum and minimumGradientJacobian matrixImplicit function theoremC^k function characterised by continuous derivatives
Statement
Let be open, let , and let and be of class C^1. Let , and let be a local extremum of the restriction of to . Suppose that the gradients are linearly independent. Then there is a unique such that
Remarks
The numbers are the Lagrange multipliers. Equivalently, is a critical point of the Lagrangian . The hypothesis on the gradients is the constraint qualification. It says that the Jacobian matrix has rank . The proof uses the implicit function theorem. Near , the set is the graph of a function of variables. The gradient of is orthogonal to the tangent space of at . The condition is necessary, not sufficient. Each candidate point needs a further check, for example a comparison of values on a compact set .
Reading path
To understand this page from the ground up, read these 24 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Function concept
- Function composition concept
- Fréchet derivative definition
- Function of several variables concept
- Limit of a function of several variables concept
- Local maximum and minimum definition
- Local maximum and minimum concept
- Partial derivative concept
- Differentiable function of several variables definition
- Partial derivative definition
- Constrained optimisation concept
- Differentiable on an open set definition
- Chain rule in several variables statement
- Gradient definition
- Higher partial derivatives definition
- Jacobian matrix definition
- Iterated derivative definition
- Derivative of the inverse function statement
- Jacobian determinant definition
- C^k function characterised by continuous derivatives statement
- Inverse function theorem statement
- Implicit function theorem statement
- Lagrange multipliers statement
Where this leads
1 page builds on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Lagrange_multiplier, Statement
- Web https://en.wikipedia.org/wiki/Lagrange_multiplier, Multiple constraints
About this page
| Tag | 0VKKP8X6Q6 |
|---|---|
| URI | m2://0VKKP8X6Q6 |
| Aliases | lagrange-multiplier-theorem, method-of-lagrange-multipliers |
| Kind | statement, theorem |
| Writing | W1 stated |
| MSC | 90C46 |
| Status | This copy of the site has no build data. Run m2 status 0VKKP8X6Q6. |
| Uses | Constrained optimisation, Local maximum and minimum, Gradient, Jacobian matrix, Implicit function theorem, C^k function characterised by continuous derivatives |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge about out: the concepts that the statement is about (0 of 1)
- edge proves in: at least one proof node (0 of 1)
- edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
- explanation L2 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.