0% found this document useful (0 votes)
7 views6 pages

Simplex Method in Operations Research

The document presents three linear programming problems solved using the simplex method, detailing the original, intermediate, and final tables for each problem. The optimal solutions for the first two problems are Z=430 with X1=1.5 and X2=2.5, and Z=11 with X1=1, X2=0.33333, and X3=0, respectively, while the third problem is deemed unbounded with no optimal solution. A bibliography is included, referencing key texts in operations research.

Translated by

ScribdTranslations
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views6 pages

Simplex Method in Operations Research

The document presents three linear programming problems solved using the simplex method, detailing the original, intermediate, and final tables for each problem. The optimal solutions for the first two problems are Z=430 with X1=1.5 and X2=2.5, and Z=11 with X1=1, X2=0.33333, and X3=0, respectively, while the third problem is deemed unbounded with no optimal solution. A bibliography is included, referencing key texts in operations research.

Translated by

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

ACTIVITY 4 - SIMPLEX METHOD

OPERATIONS RESEARCH I

NELSON FABIAN AMORTEGUI RÍOS

IBEROAMERICAN UNIVERSITY CORPORATION

09 DE NOVIEMBRE DE 2022
1. Solve the following linear programming problem using the simplex method:

Max Z=120X1+100X2 Z-120X1-100X2=0


Change of model
canonical to standard
2X1 + 2X2 + S1 = 8
Subject to:
5X1 + 3X2 + S2 = 15
2x1 + 2x2 ≤ 8
5x1+3x2≤15
xj≥0, j=1,2

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:

Max Z=8X1+9X2+5X3 Switch from standard canonical model


Z-8x1-9x2-5x3=0

Subject to:
x1 + x2 + 2x3 ≤ 2 X1 + x2 + 2x2 + s1 < 2

2x1 + 3x2 + 4x3 ≤ 3 2x1 + 3x + 4x3 + s2 < 3


6x1 + 6x2 + 2x3 ≤ 8 6x1 + 6x2 + 2x3 + s3 < 8
xj ≥ 0, j = 1, 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

Z=11; Optimal solution


X1=1
X2=0,33333
X3=0
3. Solve the following linear programming problem using the simplex method:

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:

Hillier, F. (2015). Operations Research. (10th ed.) McGraw-Hill Interamericana.

González Ariza, Á. L. and García Llinás, G. (2015). Practical manual of research


Operations I (4th ed.). University of the North.

You might also like