Aplique el Método Simplex al siguiente problema de Programación Lineal:

Min 𝑍 = −6𝑥1 − 4𝑥2 − 5𝑥3 − 8𝑥4

s.a.
6𝑥1 + 8𝑥2 + 4𝑥3 + 2𝑥4 ≤ 15
15𝑥1 + 5𝑥2 + 𝑥3 + 𝑥4 ≤ 24
−7𝑥1 + 5𝑥2 + 𝑥3 + 3𝑥4 ≤ 12
4𝑥1 + 𝑥2 + 8𝑥3 + 5𝑥4 ≤ 16
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
MIN=-6*x1-4*x2-5*x3-8*x4;
!Sujeto a;
6*x1+8*x2+4*x3+2*x4<=15;
15*x1+5*x2+x3+x4<=24; LINGO
-7*x1+5*x2+x3+3*x4<=12;
4*x1+x2+8*x3+5*x4<=16;

TABLA INICIAL: ITERACIÓN 0

Z x1 x2 x3 x4 h1 h2 h3 h4 b
Z 1 6 4 5 8 0 0 0 0 0
h1 0 6 8 4 2 1 0 0 0 15
h2 0 15 5 1 1 0 1 0 0 24
h3 0 -7 5 1 3 0 0 1 0 12
h4 0 4 1 8 5 0 0 0 1 16

VBE: x4
VBS: h4

ITERACIÓN 1

Z x1 x2 x3 x4 h1 h2 h3 h4 b
Z 1 -2/5 12/5 -39/5 0 0 0 0 -8/5 -128/5
h1 0 22/5 38/5 4/5 0 1 0 0 -2/5 43/5
h2 0 71/5 24/5 -3/5 0 0 1 0 -1/5 104/5
h3 0 -47/5 22/5 -19/5 0 0 0 1 -3/5 12/5
x4 0 4/5 1/5 8/5 1 0 0 0 1/5 16/5

VBE: x2
VBS: h3
 ITERACIÓN 2

Z x1 x2 x3 x4 h1 h2 h3 h4 b
Z 1 52/11 0 -63/11 0 0 0 -6/11 -14/11 -296/11
h1 0 227/11 0 81/11 0 1 0 -19/11 7/11 49/11
h2 0 269/11 0 39/11 0 0 1 -12/11 5/11 200/11
x2 0 -47/22 1 -19/22 0 0 0 5/22 -3/22 6/11
x4 0 27/22 0 39/22 1 0 0 -1/22 5/22 34/11

VBE: x1
VBS: h1

ITERACIÓN 3: TABLA FINAL

Z x1 x2 x3 x4 h1 h2 h3 h4 b
Z 1 0 0 -1683/227 0 -52/227 0 -34/227 -322/227 -6340/227
x1 0 1 0 81/227 0 11/227 0 -19/227 7/227 49/227
h2 0 0 0 -1176/227 0 -269/227 1 217/227 -68/227 2929/227
x2 0 0 1 -23/227 0 47/454 0 11/227 -16/227 457/454
x4 0 0 0 303/227 1 -27/454 0 13/227 43/227 1283/454

Solución Óptima:
Global optimal solution found.
𝟔𝟑𝟒𝟎 Objective value: -27.92952
𝒛∗ = − Total solver iterations: 3
𝟐𝟐𝟕
𝟒𝟗 𝟒𝟓𝟕 𝟐𝟗𝟐𝟗 Variable Value
𝒙𝟏 ∗ = 𝒉𝟏 ∗ = 𝟎 𝒙𝟐 ∗ = 𝒉𝟐 ∗ = X1 0.2158590
𝟐𝟐𝟕 𝟒𝟓𝟒 𝟐𝟐𝟕
X2 1.006608
𝟏𝟐𝟖𝟑 X3 0.000000
𝒙𝟑 ∗ = 𝟎 𝒉𝟑 ∗ = 𝟎 𝒙𝟒 ∗ = 𝒉𝟒 ∗ = 𝟎 X4 2.825991
𝟒𝟓𝟒
Row Slack or Surplus
1 -27.92952
2 0.000000
3 12.90308
4 0.000000
5 0.000000