Scribd
Upload
12 views2 pages

Optimización Simplex: Problemas y Soluciones

The document presents a linear programming problem to maximize the objective function Z = 3x1 + 7x2 subject to 4 constraints, and adds slack and surplus variables to convert it into standard form for the simplex method. The simplex method is then applied in two phases, showing the simplex table at each phase. The conclusion is that there is no optimal solution.

Uploaded by

Andrés Escobar Villa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
12 views2 pages

Optimización Simplex: Problemas y Soluciones

The document presents a linear programming problem to maximize the objective function Z = 3x1 + 7x2 subject to 4 constraints, and adds slack and surplus variables to convert it into standard form for the simplex method. The simplex method is then applied in two phases, showing the simplex table at each phase. The conclusion is that there is no optimal solution.

Uploaded by

Andrés Escobar Villa
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Maximizar Z = 3x1 + 7x2

sujeto a:

6x1 + 11x2 <= 66


2x1 + x2 <= 10
0.5x1 + 0.4x2 >= 6
x1 + x2 >= 4

Agregando variables de holgura y exceso para usar el simplex de 2 fases:

6x1 + 11x2 + x3 = 66
2x1 + x2 + x4 = 10
0.5x1 + 0.4x2 -x5 + y1 = 6
x1 + x2 -x6 + y2 = 4

x1 x2 x3 x4 x5 x6 y1 y2 b t
x3 6 11 1 0 0 0 0 0 66 11
x4 2 1 0 1 0 0 0 0 10 5
y1 1/2 2/5 0 0 -1 0 1 0 6 12
y2 1 1 0 0 0 -1 0 1 4 4
z -3 -7 0 0 0 0 0 0 0
z* -3/2 -7/5 0 0 1 1 0 0 -10

x1 x2 x3 x4 x5 x6 y1 y2 b t
x3 0 5 1 0 0 6 0 -6 42 7
x4 0 -1 0 1 0 2 0 -2 2 1
y1 0 -1/10 0 0 -1 1/2 1 -1/2 4 8
x1 1 1 0 0 0 -1 0 1 4 –
z 0 -4 0 0 0 -3 0 3 12
z* 0 1/10 0 0 1 -1/2 0 3/2 -4
x1 x2 x3 x4 x5 x6 y1 y2 b t
x3 0 8 1 -3 0 0 0 0 36 9/2
x6 0 -1/2 0 1/2 0 1 0 -1 1 –
y1 0 3/20 0 -1/4 -1 0 1 0 7/2 70/3
x1 1 1/2 0 1/2 0 0 0 0 5 10
z 0 -11/2 0 3/2 0 0 0 0 15
z* 0 -3/20 0 ¼ 1 0 0 1 -7/2

se observa
que no hay
solución
óptima

You might also like