Browsing French translation

48083 of 76009 results
48083.
The linear programming (LP) problem can be formulated as: Solve A.x >= V1, with V2.x maximal. A is a matrix, x is a vector of (nonnegative) variables, V1 is a vector called the right hand side, and V2 is a vector specifying the objective function.
Description
Un problème d'optimisation linéaire (LP) peut être formulé ainsi[nbsp]: Résoudre A.x >= V1, avec V2.x maximal. A est une matrice, x un vecteur de variables (non-négatives), V1 un vecteur appelé de partie droite et V2 un vecteur précisant la fonction à optimiser.
Translated by Michael Vogt
Reviewed by Pierre Slamich
Located in Package: liblpsolve55-dev
48083 of 76009 results

This translation is managed by Ubuntu French Translators, assigned by Ubuntu Translators.

You are not logged in. Please log in to work on translations.