Programacion Lieal

Resuelva los siguientes problemas por medio del Método Simplex Dual.

a) Minimizar

Z= 2X1 + 3X2

Sujeto a:

2X1 + 2X2 ≤30

X1 + 2X2 ≥10X1, X2 ≥ 0

SOLUCION

|TABLA 1 | | |0 |0 |0 |0 |-1 |
|BASE |Cb |P0|P1 |P2 |P3 |P4 |P5 |
|P3 |0 |30 |2 |2 |1 |0|0 |
|P5 |-1 |10 |1 |2 |0 |-1 |1 |

|TABLA 2 | ||0 |0 |0 |0 |-1 |
|BASE |Cb |P0 |P1 |P2 |P3 |P4 |P5|
|P3 |0 |20 |1 |0 |1 |1 |-1 |
|P2 |0 |5 |0.5|1 |0 |-0.5 |0.5 |
|Z | |0 |0 |0 |0 |0 |
|BASE|Cb |P0 |P1 |P2 |P3 |P4 |
|P3 |0 |20 |1 |0 |1|1 |
|P2 |-3 |5 |0.5 |1 |0 |-0.5 |
|Z | |-15 |0.5|0 |0 |1.5 | |
|BASE |Cb |P0 |P1 |P2 |P3 |P4 |P5 |...