"इष्टतमकरण": अवतरणों में अंतर

पंक्ति 35:
* [[Trajectory optimization]] is the speciality of optimizing trajectories for air and space vehicles.
In a number of subfields, the techniques are designed primarily for optimization in dynamic contexts (that is, decision making over time):
* [[विचरण कलन]] (Calculus of variations]]) seeks to optimize an objective defined over many points in time, by considering how the objective function changes if there is a small change in the choice path.
* [[Optimalइष्टतम controlनियंत्रण]] theory is a generalization of the calculus of variations.
* [[Dynamicगतिक programmingक्रमादेशन]] (Dynamic programming) studies the case in which the optimization strategy is based on splitting the problem into smaller subproblems. The equation that relates these subproblems is called the [[Bellman equation]].
* [[Mathematical programming with equilibrium constraints]] is where the constraints include [[variational inequalities]] or [[complementarity theory|complementarities]].