minimización método simplex
4
DEBER #8 NOMBRE: YAMBAY JOSSELIN 1)MAXIMIZAR: 1,5 X1 + 2 X2 MAXIMIZAR: 1.5 X1 + 2 X2 + 0 X3 + 0 X4 + 0 X5 2 X1 + 2 X2 ≤ 8 2 X1 + 6 X2 ≥ 12 2 X1 + 2 X2 + 1 X3 = 8 2 X1 + 6 X2 -1 X4 + 1 X5 = 12 X1, X2 ≥ 0 X1, X2, X3, X4, X5 ≥ 0
-
Upload
jossy-yambay -
Category
Education
-
view
91 -
download
0
Transcript of minimización método simplex
DEBER #8
NOMBRE: YAMBAY JOSSELIN
1)MAXIMIZAR: 1,5 X1 + 2 X2
MAXIMIZAR: 1.5 X1 + 2 X2 + 0 X3 + 0 X4 + 0 X5
2 X1 + 2 X2 ≤ 82 X1 + 6 X2 ≥ 12
2 X1 + 2 X2 + 1 X3 = 82 X1 + 6 X2 -1 X4 + 1 X5 = 12
X1, X2 ≥ 0 X1, X2, X3, X4, X5 ≥ 0
Punto Coordenada X (X1) Coordenada Y (X2) Valor de la función objetivo (Z)
O 0 0 0
A 0 4 8
B 4 0 6
C 3 1 6.5
D 0 2 4
E 6 0 9
2)MAXIMIZAR: 4 X1 + 5 X2
MAXIMIZAR: 4 X1 + 5 X2 + 0 X3 + 0 X4 + 0 X5 + 0 X6
2 X1 + 2 X2 ≤ 102 X1 + 6 X2 ≥ 181 X1 + 1 X2 = 7
2 X1 + 2 X2 + 1 X3 = 102 X1 + 6 X2 -1 X4 + 1 X6 = 181 X1 + 1 X2 + 1 X5 = 7
X1, X2 ≥ 0 X1, X2, X3, X4, X5, X6 ≥ 0