Operations research, mathematical programming Basic notions of optimization Concept
Constrained optimisation
Builds on Function of several variablesLocal maximum and minimum
Summary
Constrained optimisation looks for the maximum or minimum of an objective function of several variables over the set of points that satisfy given constraints. Typical constraints are equations and inequalities .
Remarks
An example is to maximise on the circle . The maximum value is , at and . For equality constraints, one method solves the constraints for some variables and substitutes them into . Another method uses Lagrange multipliers. A constrained extremum need not be a critical point of . In the example above, .
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Euclidean space object
- Function concept
- Function of several variables concept
- Local maximum and minimum concept
- Constrained optimisation concept
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Constrained_optimization, General form
- Web https://en.wikipedia.org/wiki/Constrained_optimization, Equality constraints
About this page
| Tag | 0EPW94MJ1P |
|---|---|
| URI | m2://0EPW94MJ1P |
| Aliases | constrained-optimization |
| Kind | concept |
| Writing | W0 stub |
| MSC | 90C30 |
| Uses | Function of several variables, Local maximum and minimum |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.