Professional Documents
Culture Documents
Simplex: Problema No.1
Simplex: Problema No.1
Problema No.1
Maximizar
0 = -101 + 202
Sujeto a:
+ 2 4
-2 + 3 -6
SOLUCION:
Resolvindolo por mtodo Simplex quedara de la siguiente manera:
+ 10 - 20 = 0
S.A.
+ 2 + = 4
-2 + 3 + = -6
1
10
0
1
0
-2
Columna Pivote =
Elemento Pivote = 2 (fila )
1
0
0
SOLUCIONES:
= 40
= 0
= 2
= 0
= -12
-20
2
3
20
0.5
-3.5
0
1
0
0
1
0
0
0
1
10
0.5
-1.5
0
0
1
Solucin
0
4
-6
Solucin
40
2
-12
Operacin
Operacin
(20)+
/2
(-3)+
Problema No.2
Maximizar
Z= 3 + 4
S.A.
+ 7
+ 2 10
2 + 11
Z - 3 - 4 = 0
+ + = 7
+ 2 + = 10
2 + + = 11
1
-3
0
1
0
1
0
2
Columna Pivote =
Elemento Pivote = 2 (fila )
-4
1
2
1
0
0
1
0
1
-1
0
0.5
0
0.5
0
1.5
Columna Pivote =
Elemento Pivote = 1.5 (fila )
1
0
0
0
SOLUCIONES:
= 4
= 3
= 24
0
0
0
1
0
0
1
0
0
1
0
0
0
0
1
0
0
1
0
0
0
1
0
0
0
0
0
1
Solucin
0
7
10
11
Operacin
2
-0.5
0.5
-0.5
0
0
0
1
Solucin
20
2
5
6
Operacin
(4) +
(-1) +
/ 2
(-1) +
1.66
-0.33
0.67
-0.33
0.66
-0.33
-0.33
0.67
Solucin
24
0
3
4
Operacin
(1)+
(-0.5)+
(-0.5)+
/ 1.5