P. 1
Problema Metodo Simplex 1

Problema Metodo Simplex 1

|Views: 4|Likes:

More info:

Published by: Gustavo Fernando Florentino Carreon on Apr 15, 2013
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

04/15/2013

pdf

text

original

Maximize p = 5000x + 3000y subject to

3x + 5y <= 40
5x + 2y <= 10
Solucion Optima: p = 15000; x = 0, y = 5

Tableau #1
x y s1 s2 p
3 5 1 0 0 40
5 2 0 1 0 10
-5000 -3000 0 0 1 0

Tableau #2
x y s1 s2 p
0 3.8 1 -0.6 0 34
1 0.4 0 0.2 0 2
0 -1000 0 1000 1 10000

Tableau #3
x y s1 s2 p
-9.5 0 1 -2.5 0 15
2.5 1 0 0.5 0 5
2500 0 0 1500 1 15000

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)//-->