P. 1
SOLUCIONES GEOMETRICAS

SOLUCIONES GEOMETRICAS

|Views: 93|Likes:
Publicado porelpinguino32

More info:

Published by: elpinguino32 on May 12, 2012
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as DOCX, PDF, TXT or read online from Scribd
See more
See less

05/12/2012

pdf

text

original

1) Maximizar Z= 5x

1
+ 7x
2

Sujeto a

X1 +X2 <= 150 ….. (1)
X1 <= 120 ……(2)
X2 <= 100 …….(3)
X1 >= 0 …….(4)
X2 >= 0 …….(5)

Restricciones (1):

X1 + X2 =150
X1 = 0 X2=0
X2 = 150 X1=150
(0.150) (150.0)

Hallando la función objetivo
Coordenadas ( 60, 0)

Max Z= 5X1 + 7X2
= 5 (60) + 7(0) =300

5X1 + 7X2 = 300
X1 = 0 X2 = 0
X2= 42.85 X1=60

HALLANDO PUNTO B: (INTERCEPTA RECTAS I Y 3)

X1 + X2 = 150 X1 +100 = 150
X2 =100 X1 =50

FUNCION OBJETIVO
MAX Z = 5X1 + 7X2
= 5(50) + 7(100) =950














2) MINIMIZAR Z = 1000 X1 + 2000X2
Sujeto a

8X1 + 2X2 >=16 (1)
X1 +X2 >=5 (2)
2X1 + 7X2 >=20 (3)
X1 >= 0 (4)
X2 >=0 (5)

RESTRICCION 1:
8X1 + 2X2 = 16
X1=0 X2=0
X2 =8 X1=2
(0,8) (2,0)

RESTRICCION 2:
X1 + X2 =5
X1=0 X2=0
X2= 5 X1=5
(0,5) (5,0)

RESTRICCION 3:
2X1 + 7X2 =20
X1 = 0 X2=0
X1=2.86 X1=10
(0,2.86) (10,0)

HALLANDO f.O : COORDENADAS (3,0)
Min Z= 1000 X1 + 2000X2
= 1000 (3) + 2000 (0) = 3000
1000 X1 + 2000 X2 = 3000
X1 = 0 X2=0
X2=1.5 X1=3
(0,1.5) (3,0)

HALLANDO PUNTO C : INTERCEPTA RECTAS 2 Y 3

-7 X1 + X2 = 5
2X1 + 7X2 =20

-7X1 - 7X2 = -35
2X1 + 7X2 = 20
-5X1 = -15
X1 =3

 X1 +X2 = 5
3 + X2 = 5
X2 = 2
Funcion objetivo
Min Z = 1000x1 + 2000X2
= 1000(3) + 2000(2) =7,000
3) MAXIMIZAR Z = 25X1 + 20 X2

S .A
X1 <= 20 ….. (1)
X2 <= 30 ……(2)
X2 – X1 >= 0 …(3)
X2 – 2X1 <= 0 …. (4)
X1 >= 0 …..(5)
X2 >=0 ….. (6)

Restriccion 3:SE TOMA CUALQUIER DATO PARA PODER GRAFICAR

X2 – X1 = 0
X1 = 10 X2 = 20
X2 = 10 X1 = 20
(10 , 10) (20 , 20)

Restriccion 4: SE TOMAN CUALKIER DATOS PARA PODER GRAFICAR

X2 – 2X1 = 0
X1 = 10 X2=10
X2 = 20 X1 = 5
(10 , 20) (5 , 10)

RESTRICCION 3
X2 – X1 >=0
X2 >= X1

COORD (15,0) COORD (0,15) SE TOMAN DATOS SOBRE Y ABAJO DE LA RECTA CUALKIERA

0 > 15 FALSO 15 > 0 VERDADERO

RESTRICCION (4)
X2 – 2X1 <=0
X2 <=2X1
COORD (15,0) COORD (0,15)
0< 2(15) 15 <2(0)
0 < 30 VERDADERO 15 < 0 FALSO

HALLANDO FUNCION OBJETIVO: COORD (10,0)

MAX Z = 25X1 + 20X2
= 25 (10) + 20(0) =250

25X1 + 20X2 =250
X1= 0 X2 =0
X2 = 12.5 X1=10
(0,12.5) (10,0)
FUNCION OBJETIVO:
MAX Z = 25X1 + 20 X2
= 25 (20) + 20 (30)
=1,100

000 .O : COORDENADAS (3.0) HALLANDO PUNTO C : INTERCEPTA RECTAS 2 Y 3 -7 X1 + X2 = 5 2X1 + 7X2 =20 -7X1 .7X2 = -35 2X1 + 7X2 = 20 -5X1 = -15 X1 =3  X1 +X2 = 5 3 + X2 = 5 X2 = 2 Funcion objetivo Min Z = 1000x1 + 2000X2 = 1000(3) + 2000(2) =7.86) (10.1.5) (3.5 X1=3 (0.0) RESTRICCION 2: X1 + X2 =5 X1=0 X2=0 X2= 5 X1=5 (0.86 X1=10 (0.5) (5.0) RESTRICCION 3: 2X1 + 7X2 =20 X1 = 0 X2=0 X1=2.2) MINIMIZAR Z = 1000 X1 + 2000X2 Sujeto a 8X1 + 2X2 >=16 (1) X1 +X2 >=5 (2) 2X1 + 7X2 >=20 (3) X1 >= 0 (4) X2 >=0 (5) RESTRICCION 1: 8X1 + 2X2 = 16 X1=0 X2=0 X2 =8 X1=2 (0.0) HALLANDO f.8) (2.0) Min Z= 1000 X1 + 2000X2 = 1000 (3) + 2000 (0) = 3000 1000 X1 + 2000 X2 = 3000 X1 = 0 X2=0 X2=1.2.

You're Reading a Free Preview

Descarga
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->