solucione los siguientes Problemas de Programacin Lineal, mediante el mtodo simplex:

Prctica

Max Z = 40 x1 + 60 X2 subject to Sujeto a : 2x1 + x2

Max 4 x1 - 2x2 + 3x3 subject to Sujeto a : x1 - x2 - x3

Max - x1 + 2x2 + 4x3 Sujeto a : x1 + x2

Max 3x1 - 2x2 + x3 Sub Sujeto a : x1 - x2 - x3

Max x1 - x2 + x3 Subje Sujeto a : ct to 2x1 - x2

Max x1 + 4x2 - x3 Sub Sujeto a : ject to x1 + x2 + x3

Max 2x1 + 4x2 - x3 Sujeto a : subject to x1 + x2 + x3

Max 3x1 - 2x2 + x3 S Sujeto a : ubject to x1 + x2 + x3

Max 5x1 - 3x2 + x3 Su Sujeto a : bject to x1 + x2

Max Z = 3X1 + 2X2 + X3 Sujeto a : X1 + 2X2 + X3 10 X1 + X2 + 2X3 9 2X1 + + 3X3 12 X1, X2, X3 0 Z = 1 X1 = 10 x2 = 2 x3 = 0 X1 6 X2 2 X3 0 Z 22

X1 = 520 X2 = 193.75 X3 = 750 Z = 379000