UADE Materia: INVESTIGACION OPERATIVA

MODELO DE PROGRAMACIN LINEAL

Resolucin grfica de problemas

Halle grficamente la solucin ptima de cada uno de los siguientes sistemas de inecuaciones (objetivo,
variables reales y de holgura):

1)

2)

3)

4)

5)

6)

7)

8)

9)

10)

11)

8x1 + 4x2 160

2x1 + 6x2 60
6x1 + 5x2 150
2x1 - 3x2 6
2x2 4
x1 + 4x2 8

x1 + x2
2x1 + 4x2
x2
x1

300
1.000
= 200
200

Z = 30x1 + 40x2 (mx)

Z = 6x1 + 4x2 (mx - mn)

Z = 6x1 + 2x2 (mx - mn)

x1 + x2 8
x1 + 3x2 12
-x1 + 2x2 4

Z = 2x1 + 6x2 (mx)

-2x1 + x2 4
2x1 - x2 2
3x1 - 3x2 3

Z = 4x1 + 2x2 (mx)

x1 + x2 2
5x1 + 2x2 10
3x1 + 8x2 12

Z = 5x1 + 3x2 (mx)

-5x1 + 3x2 15
x1 + x2 4
2x1 + x2 10

Z = 2x1 + x2 (mx)

4x1 + 5x2 10
5x1 + 2x2 10
3x1 + 8x2 12

Z = 5x1 + 3x2 (mx)

-2x1 + x2 2
x1 - x2 2
x1 + x2 5

Z = 5x1 + 2x2 (mx)

6x1 + 5x2 30
x2 1
-2x1 + 2x2 5

Z = 5x1 + 8x2 (mx)

4x1 + 5x2 10
5x1 + 2x2 10
3x1 + 8x2 12

Z = 5x1 + 8x2 (mx-mn)

12)

13)

14)

15)

16)

17)

18)

19)

4x1 + 6x2
x2
2x1 + 2x2
x1

24
3
0
1

Z = -2x1 + 4x2 (mx)

x1
2x1 + x2
x1 + 2x2
x2

2
10
8
1

Z = x1 - 2x2 (mn)

x1 - x2 0
x1
1
x2 3

Z = x1 + x2 (mx - mn)

x1 - 2x2 2
3x1 - 2x2 6
x1 + x2 7

Z = 3x1 + 2x2 (mx)

x1 + 3x2 90
5x1 + x2 100
3x1 + 2x2 120

Z = 6x1 + 4x2 (mx - mn)

x1 + 2x2 12
x1 + x2 = 8
-x1 + 2x2 4

Z = x1 + 3x2 (mx)

12
x2 4
x1
4
x2 12
3x1 - 2x2 = 0

Z = 6x1 - 4x2 (mx - mn)

x1

2x1 - x2
x1 + x2
x2
x1

= 0
1
3
1

Hallar la solucin ptima para cada uno de los siguientes objetivos:

a) Z = x1 + x2 (mx - mn)
b) Z = x1 - x2 (mx - mn)
c) Z = -x1 + x2 (mx - mn)
d) Z = -x1 - x2 (mx - mn)
e) Z = 2x1 - x2 (mx - mn)

20)

2x1 - x2 4
x1 - 2x2 2
x1 + x2 5

Z = 2x1 + x2 (mx)

Habiendo hallado la solucin ptima:

a) Modifique el problema de manera que adopte "solucin mltiple.
b) Si el recurso b3 disminuye, sobre qu recta se desplaza la solucin?
c) Si el recurso b3 disminuye a 2 unidades, cul es la nueva solucin?

Respuestas a los problemas del Prctico N 1:

1) x1 = 18; x2 = 4; 1 = 0; 2 = 0; 3 = 22; Z = 700
2) Mx. : x1 = 6; x2 = 2; 1 = 0; 2 = 0; 3 = 6; Z = 44
Mn. : x1 = 0; x2 = 2; 1 = 12; 2 = 0; 3 = 0; Z = 8
3) Mx. : x1 = 100; x2 = 200; 1 = 0; 2 = 0; 3 = 100; Z = 1.000
Mn. : x1 = 0; x2 = 200; 1 =100; 2 = 200; 3 = 200; Z = 400
4) Solucin mltiple:

Vrtice A : x1 = 2,4; x2 = 3,2; 1 = 2,4; 2 = 0; 3 = 0; Z = 24

Vrtice B : x1 = 6; x2 = 2; 1 = 0; 2 = 0; 3 = 6; Z = 24

5) Solucin indeterminada o indefinida.

6) x1 = 2; x2 = 0; 1 = 0; 2 = 0; 3 = 6; Z = 10
7) Incompatible.
8)

x1 = 1,65; x2 = 0,88; 1 = 1; 2 = 0; 3 = 0; Z = 10,88

9)

x1 = 3,5; x2 = 1,5; 1 = 7,5; 2 = 0; 3 = 0; Z = 20,5

10) x1 = 1,59; x2 = 4,09; 1 = 0; 2 = 3,09; 3 = 0; Z = 40,68

11) Mx. : Solucin indefinida.
Mn. : x1 = 1,65; x2 = 0,88; 1 = 1; 2 = 0; 3 = 0; Z = 15,29
12) x1 = 1; x2 = 3; 1 = 2; 2 = 0; 3 = 8; Z = 10
13) x1 = 2; x2 = 3; 1 = 0; 2 = 3; 3 = 0; 4 = 2; Z = -4
14) Mx. : x1 = 3; x2 = 3; 1 = 0; 2 = 2; 3 = 0; Z = 6
Mn. : x1 = 1; x2 = 1; 1 = 0; 2 = 0; 3 = 2; Z = 2
15) x1 = 4 x2 = 3; 1 = 4; 2 = 0; 3 = 0; Z = 18
16) Mx. : Solucin indefinida.
Mn. : Solucin mltiple: x1 = 11,43; x2 = 42,86; 1 = 50; 2 = 0; 3 = 0; Z = 240
17) Solucin degenerada: x1 = 4; x2 = 4; 1 = 0; 2 = 0; 3 = 0; Z = 16
18) Mx. = Mn. : Solucin mltiple: x1 = 4; x2 = 6; 1 = 8; 2 = 2; 3 = 0; 4 = 6; Z = 0
19) a) Mx. : x1 = 1,5; x2 = 3; 1 = 3,5; 2 = 0; 3 = 0,5; Z = 4,5
Mn. : x1 = 1; x2 = 2; 1 = 2; 2 = 1; 3 = 0; Z = 3
b) Mx. : x1 = 1; x2 = 2; 1 = 2; 2 = 1; 3 = 0; Z = -1
Mn. : x1 = 1,5; x2 = 3; 1 = 3,5; 2 = 0; 3 = 0,5; Z = -1,5
c) Mx. : x1 = 1,5; x2 = 3; 1 = 3,5; 2 = 0; 3 = 0,5; Z = 1,5
Mn. : x1 = 1; x2 = 2; 1 = 2; 2 = 1; 3 = 0; Z = 1
d) Mx. : x1 = 1; x2 = 2; 1 = 2; 2 = 1; 3 = 0; Z = -3
Mn. : x1 = 1,5; x2 = 3; 1 = 3,5; 2 = 0; 3 = 0,5; Z = -4,5
e) Mx. = Mn. : Solucin mltiple: x1 = 1; x2 = 2; 1 = 2; 2 = 1; 3 = 0; Z = 0
20) x1 = 3; x2 = 2; 1 = 0; 2 = 3; 3 = 0; Z = 8
a) Si Z = x1 + x2 (mx) la pendiente de Z coincidir con la pendiente de R3.
b) Se desplaza sobre la recta 1.
c) x1 = 2; x2 = 0; 1 = 0; 2 = 0; 3 = 0; Z = 4