(also called linear optimization) is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. - wikipedia

See also

• Recherche Opérationnelle
  • Explication du Branch&Bound
• Simplex algorithm a popular algorithm for linear programming. In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions.
  • La Méthode de Simplexe
  • Recherche opérationnelle et applications