Browsing Spanish translation

13087 of 21331 results
13087.
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 problema de programación lineal (LP) puede formularse como: Resolver A.x >= V1, con V2.x máximo. A es una matriz, x es un vector de variables (no negativas). V1 es un vector llamado "del lado de la mano derecha", y V2 es un vector que especifica la función objetivo.
Translated by Michael Vogt
Located in Package: lp-solve-doc Package: lp-solve
13087 of 21331 results

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

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