Ejercicio A:

Maximize z = 2x1 + 2x2 - 3x3 + 5x4 subject to

x1 + 2x2 - 2x3 + 4x4 <= 40
2x1 - x2 + x3 + 2x4 <= 8
4x1 -2x2 + x3 - x4 <= 10
Tableau #1
x1 x2 x3
1 2 -2
2 -1 1
4 -2 1
-2 -2 3

x4
4
2
-1
-5

s1
1
0
0
0

s2
0
1
0
0

s3 z
0 0
0 0
1 0
0 1

40
8
10
0

Tableau #2
x1 x2 x3
-3 4 -4
1 -0.5 0.5
5 -2.5 1.5
3 -4.5 5.5

x4 s1
0
1
1 0
0 0
0 0

s2
-2
0.5
0.5
2.5

s3 z
0 0
0 0
1 0
0 1

24
4
14
20

Tableau #3
x1
x2
-0.75 1
0.625 0
3.125 0
-0.375 0

x3
-1
0
-1
1

Tableau #4
x1 x2 x3
0
1 -1.24
0
0
0.2
1
0 -0.32
0
0 0.88

x4
0
1
0
0

x4
0
1
0
0

s1
0.25
0.125
0.625
1.125

s1
0.4
0
0.2
1.2

s2
-0.5
0.25
-0.75
0.25

s2
-0.68
0.4
-0.24
0.16

s3
0
0
1
0

s3
0.24
-0.2
0.32
0.12

z
0
0
0
1

z
0
0
0
1

6
7
29
47

12.96
1.2
9.28
50.48

Solucin Optima: z = 50.48; x1 = 9.28, x2 = 12.96, x3 = 0, x4 = 1.2

Ejercicio B
Maximize z = 8x1 + 6x2 + 3x3 - 2x4 subject to
x1 + 2x2 - 2x3 + 4x4 <= 40
2x1 - x2 + x3 + 2x4 <= 8
4x1 -2x2 + x3 - x4 <= 10
Tableau #1
x1 x2 x3
1 2 -2
2 -1 1
4 -2 1
-8 -6 -3

x4
4
2
-1
2

s1
1
0
0
0

s2
0
1
0
0

0
0
1
0

Tableau #2
x1 x2
x3
x4
s1
0 2.5 -2.25 4.25 1
0 0
0.5
2.5
0
1 -0.5 0.25 -0.25 0
0 -10 -1
0
0
Tableau #3
x1 x2 x3
0 1 -0.9
0 0 0.5
1 0 -0.2
0 0 -10
Tableau #4
x1 x2 x3
0 1 0
0 0 1
1 0 0
0 0 0

x4
1.7
2.5
0.6
17

x4
6.2
5
1.6
67

s1
0.4
0
0.2
4

s1
0.4
0
0.2
4

s2
0
1
0
0

s3 z
0 40
0 8
0 10
1 0

s2
0
1
0
0

s3
-0.25
-0.5
0.25
2

s3 z
-0.1 0
-0.5 0
0.2 0
1
1

s2 s3
1.8 -1
2
-1
0.4 0
20 -9

z
0
0
0
1

z
0
0
0
1

15
3
10
170

20.4
6
11.2
230

No existe solucin ptima para este problema.

37.5
3
2.5
20

Ejercicio C
Maximize z = 3x1 - x2 + 3x3 + 4x4 subject to
x1 + 2x2 - 2x3 + 4x4 <= 40
2x1 - x2 + x3 + 2x4 <= 8
4x1 -2x2 + x3 - x4 <= 10
Tableau #1
x1 x2 x3
1 2 -2
2 -1 1
4 -2 1
-3 1 -3

4 1
2 0
-1 0
-4 0

Tableau #2
x1 x2 x3
-3 4
-4
1 -0.5 0.5
5 -2.5 1.5
1 -1
-1

x4
0
1
0
0

Tableau #3
x1
x2
-0.75 1
0.625 0
3.125 0
0.25 0

x4

x3
-1
0
-1
-2

s1

s2
0
1
0
0

s1
1
0
0
0

0
0
1
0

s2
-2
0.5
0.5
2

s3 z
0 40
0 8
0 10
1 0

s3
0
0
1
0

z
0
0
0
1

24
4
14
16

x4 s1
s2
s3 z
0 0.25 -0.5
0 0
1 0.125 0.25 0 0
0 0.625 -0.75 1 0
0 0.25
1.5 0 1

No existe solucin ptima para este problema.

6
7
29
22

Ejercicio D
Maximize z = 5x1 - 4x2 + 6x3 - 8x4 subject to
x1 + 2x2 - 2x3 + 4x4 <= 40
2x1 - x2 + x3 + 2x4 <= 8
4x1 -2x2 + x3 - x4 <= 10
Tableau #1
x1 x2 x3
1 2 -2
2 -1 1
4 -2 1
-5 4 -6
Tableau #2
x1 x2 x3
5 0 0
2 -1 1
2 -1 0
7 -2 0

x4
4
2
-1
8

x4

s1
1
0
0
0

s2
0
1
0
0

0
0
1
0

s3 z
0 40
0 8
0 10
1 0

s1

s2 s3 z
8 1 2 0 0 56
2 0 1 0 0 8
-3 0 -1 1 0 2
20 0 6 0 1 48

No existe solucion optima para este problema.

Ejercicio E
Maximize z = -4x1 + 6x2 - 2x3 + 4x4 subject to
x1 + 2x2 - 2x3 + 4x4 <= 40
2x1 - x2 + x3 + 2x4 <= 8
4x1 -2x2 + x3 - x4 <= 10
Tableau #1
x1 x2 x3 x4
1
2 -2 4
2 -1 1
2
4 -2 1 -1
4 -6 2 -4

s1
1
0
0
0

Tableau #2
x1 x2 x3
0.5 1 -1
2.5 0 0
5
0 -1
7
0 -4

s1 s2 s3 z
0.5 0 0
0 20
0.5 1
0 0 28
1
0
1
0 50
3
0
0 1 120

x4
2
4
3
8

s2
0
1
0
0

s3 z
0 0
0 0
1 0
0 1

40
8
10
0

No existe solucion optima para este problema.