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

पंक्ति 21:
* [[Heuristic algorithm]]s
** [[Metaheuristic]]s
* [[Constraint satisfaction]] studies the case in which the objective function ''f'' is constant (this is used in [[artificial intelligence]],<ref>{{ cite web | url=http://artificial-future.com/artificial-intelligence | title=Algorithm in Artificial Intelligence }}</ref> particularly in [[automated reasoning]])।
** [[Constraint programming]].
* Disjunctive programming used where at least one constraint must be satisfied but not all. Of particular use in scheduling.