PRACTICA DE INVESTIGACION OPERATIVA I

MÉTODO SIMPLEX PARA RESOLUCIÓN DE PROBLEMAS DE

PROGRAMACION LINEAL
Ing. Lizette Mendoza Siles

1.- FO: Max Z = 3X1 + 7X2 + 5X3

SA: X1 + X2 + X3  50
2X1 +3X2 +X3  100
X1, X2, X3  0

2.- FO: Max Z = 3X1 + 2X2

SA: 2X1 + X2  100
X1 +X2  80
X1  40
X1, X2  0

3.- FO: Max Z = X1 + 4X2

SA: X1 + 2X2  6
2X1 + X2  8
X1, X2  0

4.- FO: Max Z = 3X1 + X2

SA: 2X1 - X2  2
-X1 + X2  4
X1 ,X2  0

5.- FO: Max Z = -X1 + X2

SA: 2X1 + X2  4
X1 + X2  2
X1, X2  0

6.- FO: Max Z = 3x1 + 2x2 + 4x3

SA: x1 + x2 + 2x3  4
2x1 + + 3x3  5
2x1 + x2 + 3x3  7
x1, x2, x3  0

7.- FO: Max Z = 2x1 + x2

SA: 2x1 + 3x2  3
x1 + 5x2  1
2x1 + x2  4
4x1 + x2  5
x1, x2  0

8.- FO: Max Z = 2x1 + 3x2 + 5x3 + 4x4

SA: x1 + 2x2 + 3x3 + x4  5
x1 + x2 + 2x3 + 3x4  3
x1, x2, x3, x4  0