MTODO DE GAUSS Y JORDAN (FORMA DE PIBOTEO)
EJERCICIO # 9
5222
2334
4322
5729
3
2
5
2
-15/7 -3 -6/7
4
3
2
13/7 O
8/7
-27/7
2
-13/7
-6/7
-15/7 -3 -6/7
2 3
3
-1/7 0 15/7
-27/7
-6/7
5
29/7
4
1/7
2
8/7
-10/7 -2 -4/7 -18/7
-4/7
5
2
2
2
3
25/7 0
10/7
-4/7
17/7
25/7
-1/7
13/7
5/7
0
0
0
1
10/7 -4/7 17/7
15/7
1/7
8/7
8/7 -13/7 29/7
2/7
9/7
2/7
EJERCICIO # 10
234 3
452 2
794 4
-12/5
2
-2/5
-3
-36/5
7
-1/5
-2/5
4/5
-1/5
-6/5
3
0
4
14/5
-6/5
3
9/5
-9 -18/5 -18/5
9
4
4
0
2/5 2/5
0
1
0
14/5
2/5
2/5
9/5
2/5
2/5
EJERCICIO # 11
x1
2
4
7
x2
3
5
9
x3
4
2
4
3
2
4
- 2/5
4/5
- 1/5
0
1
0
14/5
2/5
2/5
9/5
2/5
2/5
-2/5 X1+14/5X3= 9/5
-2/5 X1+14/5X3= 9/5
-1/5X1+ 2/5X3 =2/5 (2)
-2/5 X1-4/5X3= 4/5
10/5X3=4/5
X3= 1/2
EJERCICIO #12
7
4
5
8
4
2
3
6
9
3
4
3
7
7
5
6
5
8
6
2
5
2
4
3
7
13/4
- 5/2
- 5/4
0/1
7/8
5/8
17/4
11/4
- 3/4
3/4
9/2
3/2
- 11/8
7/8
7/4
13/4
0/1
1/1
0/1
0/1
3
5
2
3
4
2/1
3/2
- 1/2 15/4
1/2
0/1 3/2
6/1 7/2
EJERCICIO # 13
3
4
2
3
8
1
- 5/2
2/1
- 17/2
3/2
4
2
8
5
3
2
3
4
9
2
0
0
0
0
1
5
6
7
8
5
0
- 3/2
- 3/1
- 29/2
5/2
3
2
9
3
3
2
3
4
2
2
0
- 5/2
3/1
- 21/2
3/2
0
0/1
0/1
- 7/1
1
EJERCICIO # 14
Vector entrante: nmero ms pequeo que existe en z
Vector saliente: de la divisin del valor para cada uno del vector r entrante del cual se toma el
menor positivo
Pivoteo: nmero de interseccin entre el vector entrante y vector saliente
MAXIMIZAR
S.A
Z= 20A+30B
2A +2B <= 5
A+B <=3
A,B >=0
V saliente
vector saliente
VB
Z
H1
H2
VB
Z
B
H2
A
-20
2
1
B
-30
2
1
H1
0
1
0
H2
0
0
1
VALOR
0
5
3
A
10
1
0
B
0
1
0
H1
15
1/2
- 1/2
H2
0
0
1
VALOR
75
5/2
1/2
pivote
S.O
V.O
Z=75
B=5/2
H2=1/2
EJERCICIO # 15
MAXIMIZAR
Z= 3X1+4X2 +9X3
S.A
2X1+2X2 <=10
2X2 +5X3 <=16
3X1-2X2 -7X3 <=9
X1>=0 , J 1.. 3
Z-3X1-4X2 -9X3=0
2X1+2X2 +h1=10
2X2 +5X3+h2 =16
3X1-2X2 -7X3 +h3 =9
Xj , hj , J 1.. 3>=0
VB
Z
H1
H2
H3
X1
-3
2
0
3
X2
-4
2
3
-2
X3
-9
0
5
-7
H1
0
1
0
0
H2
0
0
1
0
H3
0
0
0
1
VALOR
0
10
16
9
EJERCICIO # 16
Maximizar <= +holgura
= + artificial
>= + artificial y - una holgura
Maximizar Z= 3 X1 +2X2
S.A
2x1 +x2 <= 18
2x1+3x2<= 42
3x1+x2<=24
X1,X2>=0
FORMA ESTNDAR
Z=-3X1-2X2+0H1+0H2+0H3=0
2x1 +x2+H1
= 18
2x1+3x2 +H2 = 42
3x1+x2
+H3=24
X1,X2,H1,H2,H3 > =0
FORMA DE ECUACIN
Z-3X1-2X2-0H1-0H2-0H3=0
2x1 +x2+H1
= 18
2x1+3x2 +H2 = 42
3x1+x2
+H3=24
X1,X2,H1,H2,H3 >=0
SO
VO
VB
Z
HI
H2
H3
Z
1
0
0
0
X1
-3
2
2
3
VB
Z
HI
H2
X1
Z
1
0
0
0
X1
0
0
0
1
VB
Z
X2
H2
X1
Z
1
0
0
0
X1
0
0
0
1
VB
Z
X2
H3
X1
Z
1
0
0
0
X1
0
0
0
1
Z= 33
X1=3
X2=12
H1=0
H2=0
H3=3
VARIABLES
X2
HI
H2
-2
0
0
1
1
0
3
0
1
1
0
0
VARIABLES
X2
HI
H2
-1
0
0
1/3
1
0
2 1/3 0
1
1/3
0
0
VARIABLES
X2
HI
H2
0
3
0
1
3
0
0
-7
1
0
-1
0
VARIABLES
X2
HI
H2
0
1 1/4
1
- 1/2
0
-1 3/4
0
3/4
- 1/4
H3
0
0
0
1
VALOR
0
18
42
24
H3
1
- 2/3
- 2/3
1/3
VALOR
24
2
26
8
H3
-1
-2
4
1
VALOR
30
6
12
6
H3
0
0
1
0
VALOR
33
12
3
3
EJERCICIO # 17
Maximizar Z= 3000X1+4000X2
S.A
X1+X2<=5
X1-3X2<=0
10X1+15X2<=150
20X1+10X2<=160
30X1+10X2<=150
X1,X2>=0
FORMA ECUACIN
Z- 3000X1- 4000X2-0H1-0H2-0H3-0H4-0H5=0
X1+X2+ H1
=5
X1-3X2 +H2
=0
10X1+15X2 +H3 =150
20X1+10X2 +H4 =160
30X1+10X2
+H5=150
X1,X2,H1,H2,H3,H4,H5 >=0
VB
Z
HI
H2
H3
H4
H5
Z
1
0
0
0
0
0
X1
-3000
1
1
10
20
30
VB
Z
X2
H2
H3
H4
H5
Z
1
0
0
0
0
0
X1
S.O
VO
1000
1
4
-5
10
20
Z= 20000
X1=0
X2=5
H1=0
VARIABLES
X2
-4000
1
-3
15
10
10
X2
0
1
0
0
0
0
HI
H2
0
0
1
0
0
1
0
0
0
0
0
0
VARIABLES
HI
H2
4000
0
1
0
3
1
-15
0
-10
0
-10
0
H3
0
0
0
1
0
0
H4
0
0
0
0
1
0
H3
0
0
0
1
0
0
0
0
0
0
1
0
H2=15
H3=75
H4=110
H5=100
0
0
0
0
0
1
H5
0
0
0
0
0
1
VALOR
0
5
0
150
160
150
H4
VALOR
20000
5
15
75
110
100
EJERCICIO # 18
MAXIMIZAR Z= X1+X2
S.A
X1+3X2<=26
4X1+3X2<=44
2X1+3X2<=28
X1,X2>= 0
Z-X1-X2-0H1-0H2-0H3=0
X1+3X2+H1 =26
4X1+3X2 +H2 =44
2X1+3X2 +H3=28
X1,X2,H1,H2,H3>= 0
VB
Z
HI
H2
H3
Z
1
0
0
0
X1
-1
1
4
2
X2
-1
3
3
3
VB
Z
H1
X1
H3
X1
1
0
0
0
0
0
1
0
X2
- 1/4
2 1/4
3/4
1 1/2
VB
Z
H1
X1
X2
Z
1
0
0
0
X1
0
0
1
0
X2
0
-3
0
1
S.O
VO
Z= 12
X1=8
X2=4
H1=6
H2=0
H3=0
HI
H2
0
0
1
0
0
1
0
0
VARIABLES
HI
H2
0
1/4
1
- 1/4
0
1/4
0
- 1/2
VARIABLES
HI
H2
0
1/6
1
1 1/2
0
1/2
0
- 1/3
H3
0
0
0
1
VALOR
0
26
44
28
H3
0
0
0
1
VALOR
11
15
11
6
H3
1/6
-3 1/2
- 1/2
2/3
VALOR
12
6
8
4
MTODO SIMPLEX DE PENALIZACIN
TCNICA DE LA M
Para :
Maximizar - La M
Minimizar + La M
Signo
<= se suma + una HOLGURA (H) S1
= se suma + una ARTIFICIAL (A) R1
>= se resta una HOLGURA (H)
Tcnica de la M
Variables artificiales
Mtodo simplex con penalizacin
EJERCICIO # 19
MAXIMIZAR Z =5X1 +6X2
S.a
-2x1+3x2=3
X1+2x2<= 5
6x1+7x2<=3
X1,x2>=0
FORMA ESTANDAR
Z =5X1 +6X2-MA1+0H1+0H2
-2x1+3x2+ A1 =3
X1+2x2
+H1= 5
6x1+7x2
+H2=3
X1,x2,A1,H1,H2>=0
FORMA DE ECUACION
Z -5X1 -6X2+MA1-0H1-0H2=0
-2x1+3x2+ A1 =3 (-M)
X1+2x2
+H1= 5
6x1+7x2
+H2=3
X1,x2,A1,H1,H2>=0
Z -5X1
-6X2
+MA1 -0H1-0H2=0
2MX1 -3MX2 -MA1
= -3M
Z +(2M-5)X1+ (-3M-6)X2 -H1 H2 = - 3M
VB
Z
A1
H1
H2
Z
1
0
0
0
X1
2M-5
-2
1
6
VB
Z
A1
H1
X2
Z
1
0
0
0
X1
32/7M+1/7
-32/7
- 5/7
6/7
VARIABLES
X2
HI
H2
(-3M -6)
0
0
3
0
0
2
1
0
7
0
1
VARIABLES
X2
HI
H2
0
0 (3/7M +6/7)
0
0 - 3/7
0
1 - 2/7
1
0 1/7
A1
0
1
0
0
H3
0
1
0
0
6/7.- (-3M-6)
18/7M +36/7
0 18/7M +36/7
3M+6
2M-5
-3M-6
32/7M+1/7
S.O Z= 18/7
V.O X1=0
X2=3/7
HI=29/7
H2=0
3/7M +6/7 0
0
0
0
3/7M+6/7 0
9/7M+18/7
-3M
-12/7M+18/7
VALOR
(-3 M)
3
5
3
VALOR
(-12/7M +18/7)
1 2/7
29/7
3/7
EJERCICIO # 20
MAXIMIZAR Z= 3X1 +9X2
S.a
2X1 +6X2=2
5X1+4X2=3
4X1+X2<=5
FORMA ESTANDAR
Z=3x1+9x2-MA1 MA2+0H1
2X1 +6X2+A1=2 (-M)
5X1+4X2
+A2=3 (-M)
4X1+X2
+H1 =5
FORMA DE ECUACION
Z-3x1 -9x2
+MA1 + MA2- 0H1=0
-2MX1 -6MX2 MA1
-5MX1 -4MX2
=-2M
-MA2
=-3M
Z +(-7M-3)X1+(-10M-9)X2
-0H1=-5M
VB
Z
A1
A2
H1
Z
1
0
0
0
VB
Z
X2
A2
H1
Z
1
0
0
0
VARIABLES
X2
(-10M -9)
6
4
1
X1
(-7M-3)
2
5
4
X1
-11/3M
1/3
3 2/3
3 2/3
X2
0
1
0
0
A1
A2
0
0
1
0
0
1
0
0
VARIABLES
A1
A2
5/3M+3/2 0
1/6
0
- 2/3
1
- 1/6
0
0
0
0
1
H1
0
0
0
1
VALOR
(-5 M)
2
3
5
H1
VALOR
-5/3M +3
1/3
1 2/3
4 2/3
VB
Z
X2
X1
H1
Z
1
0
0
0
S.O Z= 3
V.O X1=5/11
X2=2/11
HI=13/6
X1
O
0
1
O
VARIABLES
X2
0
1
O
0
A1
3/3 + M
5/6
-2/11
1/2
A2
1M
-1/11
3/11
-1
H1
0
0
0
1
VALOR
3
2/11
5/11
13/6