« Optimisation mathématique » : différence entre les versions
m (Remplacement de texte — « Termes privilégiés » par « Français ») |
(Nouveau terme) |
||
| Ligne 1 : | Ligne 1 : | ||
== Domaine == | ==Domaine== | ||
[[Category:Vocabulary]] | [[Category:Vocabulary]] | ||
== Définition == | ==Définition== | ||
== Français == | ==Français== | ||
optimisation mathématique | |||
==Anglais== | |||
== Anglais == | |||
===Mathematical optimization | ===Mathematical optimization=== | ||
In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.[1] | In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.[1] | ||
In the simplest case, an optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. More generally, optimization includes finding "best available" values of some objective function given a defined domain (or input), including a variety of different types of objective functions and different types of domains. | In the simplest case, an optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. More generally, optimization includes finding "best available" values of some objective function given a defined domain (or input), including a variety of different types of objective functions and different types of domains. | ||
<br/> | <br /> | ||
<br/> | <br /> | ||
<br/> | <br /> | ||
<br/> | <br /> | ||
<br/> | <br /> | ||
<br/> | <br /> | ||
<br/> | <br /> | ||
Version du 7 mai 2019 à 16:48
Domaine
Définition
Français
optimisation mathématique
Anglais
Mathematical optimization
In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.[1]
In the simplest case, an optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function. The generalization of optimization theory and techniques to other formulations constitutes a large area of applied mathematics. More generally, optimization includes finding "best available" values of some objective function given a defined domain (or input), including a variety of different types of objective functions and different types of domains.
Contributeurs: Claude Coulombe, Jacques Barolet, wiki
