Jelaskan Optimization dari Analisis numeris dalam bahasa sunda

Optimization problems ask for the point at which a given function is maximized (or minimized). Often, the point also has to satisfy some constraints.

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 déals with the case that both the objective function and the constraints are linéar. A famous method in linéar programming is the simplex method.

The method of Lagrange multipliers can be used to reduce optimization problems with constraints to unconstrained optimization problems.