Simplex Method in Operations Research
Simplex Method in Operations Research
OPERATIONS RESEARCH I
09 DE NOVIEMBRE DE 2022
1. Solve the following linear programming problem using the simplex method:
ORIGINAL TABLE
Z X1 X2 S1 S2 Total
R 1 -120 -100 0 0 0
R 0 2 2 one 0 8 4
R 0 5 3 0 1 15 3
INTERMEDIATE TABLE
Z X1 X2 S1 S2 Total
R 1 0 -28 0 24 360
R 0 0 0.8 1 -0.4 2
R 0 1 0.6 0 0.2 3
FINAL TABLE
Z X1 X2 S1 S2 Total
Z 1 0 0 35 10 430
X2 0 0 1 1.25 -0.5 2.5
X1 0 1 0 -0.75 0.5 1.5
Z=430; Optimal solution
X2=2,5
X1=1,5
2. Solve the following linear programming problem using the simplex method:
Subject to:
x1 + x2 + 2x3 ≤ 2 X1 + x2 + 2x2 + s1 < 2
ORIGINAL TABLE
Z X1 X2 X3 S1 S2 S3 Total
R 1 -8 -9 -5 0 0 0 0
R 0 1 1 2 1 0 0 2
R 0 2 3 4 0 1 0 3
R 0 6 6 2 0 0 1 8
INTERMEDIATE TABLE
Z X1 X2 X3 S1 S2 S3 Total
R 1 -2 0 7 0 3 0 9
R 0 0.333333 0 0.666667 1 -0.33333 0 1
R 0 0.666667 1 1.333333 0 0.333333 0 1
R 0 2 0 -6 0 -2 1 2
FINAL TABLE
Z X1 X2 X3 S1 S2 S3 Total
Z 1 0 0 1 0 1 1 11
X1 0 0 0 1.666667 1 0 -0.16667 1
X2 0 0 1 3.333333 0 1 -0.333330.33333
X3 0 1 0 -3 0 -1 0.5 0
Max Z=2X1+3X2+X3+X4
Subject to:
x1-x2-x3 ≤2
-2x1+5x2-3x3-3x4≤10
2x1-5x2 +3x4≤8
xj ≥ 0, j = 1, 2, 3, 4
x1 6.66666667
x2 4.66666667 This problem has no solution
optimal. Since this solution is not bounded.
x3 0
x4 0
z 27.3333333
BIBLIOGRAPHY:
Retrieved from: