Revision as of 03:06, 27 January 2024 edit Bubba73 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 94,416 edits m →History ← Previous edit		Revision as of 07:00, 27 January 2024 edit undo Bubba73 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 94,416 edits m →Optimization: link Next edit →
Line 159: Optimization problems ask for the point at which a given function is maximized (or minimized). Often, the point also has to satisfy some [[Constraint (mathematics)\|constraint]]s. The field of optimization is further split in several subfields, depending on the form of the [[objective function]] and the constraint. For instance, [[linear programming]] deals with the case that both the objective function and the constraints are linear. A famous method in linear programming is the [[simplex algorithm\|simplex method]]. The method of [[Lagrange multipliers]] can be used to reduce optimization problems with constraints to unconstrained optimization problems.

Numerical analysis: Difference between revisions