2.

Minimizar Z = 3X1 + 2X2 Grafica

X1 = X (0 , 6)
Sujeto a: X1 + X2 > 6 (0 , 0)
X1 - 2X2 < 0 10
X1 < 10
X2 = Y (6 , 0)
Restriccion 1: 0 + X2 6 (0 , 0)
X2 = 6 (0 , 6)

X1 + 0 = 6
X1 = 6 (6 , 0)

Restriccion 2: X1 - 2X2 = 0
0 - 2X2 = 0
- 2X2 = 0
X2 = 0
2
X2 = 0 (0 , 0)

X1 - 2X2 = 0
X1 - 2(0) = 0
X1 - 0 = 0
X1 = 0
0
X1 = 0 (0 , 0)
 10 X1

(0 , 6) 6

(0 , 0 ) 0 1 2 3 4 5 6 7 8 9 10
(6 , 0)
3.-

Maximizar Z = 3X1 + 4X2 + 2X3

Sujeto a: X1 + X2 + 2X3 < 120

2X1 + X2 < 80
X1 + 2X2 + 2X3 < 300
X2 + X3 < 150

Metodo Simplex
Minimizar Z = 2X1 + 3X2 + 3X3

Sujeto a: X1 + X2 + 1.5X3 < 450

X2 + X3 = 400
X1 + X3 < 120

Metodo Simplex