0% found this document useful (0 votes)
20 views

Problema N°1: Simplex Primal

The document provides examples of linear programming problems solved using the simplex method. It presents 4 problems with their objectives, constraints, and steps to solve using standardization, tableau formatting, and pivoting. The problems are summarized as follows: 1) A problem with 3 variables and 3 constraints is solved, finding optimal values of X1 = 0, X2 = 105.479, X3 = 243.836, and Z = 53849.315. 2) A problem with 2 variables and 4 constraints is solved, finding X1 = 2.25, X2 = 6.75, and Z = 38250. 3) A problem with 3 variables and 3 constraints is solved, finding

Uploaded by

Hainse
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
0% found this document useful (0 votes)
20 views

Problema N°1: Simplex Primal

The document provides examples of linear programming problems solved using the simplex method. It presents 4 problems with their objectives, constraints, and steps to solve using standardization, tableau formatting, and pivoting. The problems are summarized as follows: 1) A problem with 3 variables and 3 constraints is solved, finding optimal values of X1 = 0, X2 = 105.479, X3 = 243.836, and Z = 53849.315. 2) A problem with 2 variables and 4 constraints is solved, finding X1 = 2.25, X2 = 6.75, and Z = 38250. 3) A problem with 3 variables and 3 constraints is solved, finding

Uploaded by

Hainse
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
You are on page 1/ 6

SIMPLEX PRIMAL

PROBLEMA N°1

𝐙 = 150X1 + 210X2 + 130X3


S.a.:
10X1 + 15X2 + 7X1 ≤ 3300
11X1 + 17X2 + 7X3 ≤ 3500
8X1 + 9X2 + 8X3 ≤ 2900

 Estandarización:

10X1 + 15X2 + 7X3 + S1 = 3300


11X1 + 17X2 + 7X3 + S2 = 3500
8X1 + 9X2 + 8X3 + S3 = 2900
Z = −150X1 − 210X2 − 130X3 + 0S1 + 0S2 + 0S3 = 0

BASE X1 X2 X3 S1 S2 S3 LIMITES RAZON


S1 10 15 7 1 0 0 3300 220
S2 11 17 7 0 1 0 3500 205.9 Fila pivote
S3 8 9 8 0 0 1 2900 322.2
Z -150 -210 -130 0 0 0 0

Columna pivote

FORMULA BASE X1 X2 X3 S1 S2 S3 LIMITES RAZON


(-15÷17) S1 0.29 0 0.82 1 -0.88 0 211.76 257.14
(1÷50) X2 0.65 1 0.41 0 0.06 0 205.88 500
(-9÷17) S3 2.18 0 4.29 0 -0.53 1 1047.06 243.84
(-(210÷17)) Z -14.12 0 -43.53 0 12.35 0 43235.29

FORMULA BASE X1 X2 X3 S1 S2 S3 LIMITES


(-(0.82÷4.29)) S1 -0.12 0 0 1 -0.78 -0.19 10.96
(-(0.41÷4.29)) X2 0.44 1 0 0 0.11 -0.10 105.48
(1÷4.29) X3 0.51 0 1 0 -0.12 0.23 243.84
(-(-43.53÷4.29)) Z 7.95 0 0 0 6.99 10.14 53849.32

Respuesta:

 X1 = 0
 X2 = 105.479
 X3 = 243.836
 Z = 53849.315
PROBLEMA N°2
𝐙 = 5000X1 + 4000X2
S.a.:
10X1 + 15X2 ≤ 150
20X1 + 10X2 ≤ 160
30X1 + 10X2 ≤ 135
X1 + X2 ≤ 9

 Estandarización:
10X1 + 15X2 + S1 = 150
20X1 + 10X2 + S2 = 160
30X1 + 10X2 + S3 = 135
X1 + X2 + S4 = 9
Z = −5000X1 − 4000X2 + 0S1 + 0S2 + 0S3 + 0S4 = 0

BASE X1 X2 S1 S2 S3 S4 LIMITE RAZON


S1 10 15 1 0 0 0 150 15
S2 20 10 0 1 0 0 160 8
S3 30 10 0 0 1 0 135 4.5
S4 1 1 0 0 0 1 9 9
Z -5000 -4000 0 0 0 0 0

FORMULA BASE X1 X2 S1 S2 S3 S4 LIMITE RAZON


(-10÷30)* S1 0 11.67 1 0 - 0.33 0 105 9
(-20÷30)* S2 0 3.33 0 1 - 0.67 0 70 21
(1÷30)* X1 1 0.33 0 0 0.03 0 4.5 13.5
(-1÷30)* S4 0 0.67 0 0 -0.03 1 4.5 6.75
(-(-5000÷30))* Z 0 -2333.33 0 0 166.67 0 22500

FORMULA BASE X1 X2 S1 S2 S3 S4 LIMITE


(-11.67÷0.67) S1 0 0 1 0 0.25 -17.5 26.25
(-3.33÷0.67) S2 0 0 0 1 - 0.5 -5 47.5
(-0.33÷0.67) X1 1 0 0 0 0.05 - 0.5 2.25
(1÷ 0.67) X2 0 1 0 0 -0.05 1.5 6.75
(-(-2333.33)÷0.67) Z 0 0 0 0 50 3500 38250

Respuestas

 X1 = 2.25
 X2 = 6.75
 Z = 38250
PROBLEMA N°3
𝐙 = 4X1 + 3X2 + 5X3
S.a.:
3X1 + 2X2 + 5X3 ≤ 150
X1 + 4X2 + 3X3 ≤ 160
5X1 + 3X2 + 2X3 ≤ 220

 Estandarización:
3X1 + 2X2 + 5X3 + S1 = 150
X1 + 4X2 + 3X3 + S2 = 160
5X1 + 3X2 + 2X3 + S3 = 220
Z = −4X1 − 3X2 − 5X3 + 0S1 + 0S2 + 0S3 = 0

BASE X1 X2 X3 S1 S2 S3 LIMITE RAZON


S1 3 2 5 1 0 0 150 30
S2 1 4 3 0 1 0 160 53.33
S3 5 3 2 0 0 1 220 110
Z -4 -3 -5 0 0 0 0

FORMULA BASE X1 X2 X3 S1 S2 S3 LIMITE RAZON


(-1÷5)* X3 0.6 0.4 1 0.2 0 0 30 50
(3÷5)* S2 - 0.8 2.8 0 - 0.6 1 0 70 -87.5
(-2÷5)* S3 3.8 2.2 0 - 0.4 0 1 160 42.11
(-(-5÷5))* Z -1 -1 0 1 0 0 150

FORMULA BASE X1 X2 X3 S1 S2 S3 LIMITE RAZON


(-0.6÷3.8) X3 0 0.05 1 0.26 0 -0.16 4.74 90
(-(-0.8÷3.8) S2 0 3.26 0 -0.68 1 0.21 103.68 31.77
(1÷3.8) X1 1 0.58 0 -0.11 0 0.26 42.11 72.73
-(-1÷3.8) Z 0 -0.42 0 0.89 0 0.26 192.11

BASE X1 X2 X3 S1 S2 S3 LIMITE
X3 0 0 1 0.27 -0.02 - 0.16 3.06
X2 0 1 0 -0.21 0.31 0.06 31.77
X1 1 0 0 0.02 -0.18 0.23 23.71
Z 0 0 0 0.81 0.13 0.29 205.48
Respuesta

 X1 = 23.71
 X2 = 31.77
 X3 = 3.06
 Z = 205.48
PROBLEMA N°4
MAX Z= 2X1 - 4X2 + 5X3 – 6X4
S.a.:

X1 + 4X2 – 2X3 + 8X4 <= 2

-X1 + 2 X2 + 3X3 + 4X4 <= 1

 Estandarización:
X1 + 4X2 − 2X3 + 8X4 + S1 =2
−X1 + 2X2 + 3X3 + 4X4 + S2 = 1
Z = −2X1 + 4X2 − 5X3 + 6X4 + 0S1 + 0S2 = 0

BASE X1 X2 X3 X4 S1 S2 LIMITES RAZON


S1 1 4 -2 8 1 0 2 -1
S2 -1 3 3 4 0 1 1 0.33
Z -2 4 -5 6 0 0 0

FORMULAS BASE X1 X2 X3 X4 S1 S2 LIMITES RAZON


(-(-2÷3)) S1 0.33 6 0 10.67 1 0.67 2.67 8
(1÷3) X3 -0.33 1 1 1.33 0 0.33 0.33 -1
(-(-5÷3)) Z -3.67 9 0 12.67 0 1.67 1.67

FORMULAS BASE X1 X2 X3 X4 S1 S2 LIMITES


(1÷0.33) X1 1 18 0 32 3 2 8
(-(-0.33)÷0.33) X3 0 7 1 12 1 1 3
(-(-3.67)÷0.33) Z 0 75 0 130 11 9 31

Respuesta

 X1 = 8
 X2 = 0
 X3 = 3
 X4 = 0
 Z = 31
PROBLEMA N°5
MAX Z= 4X1 + 5X2 - 3X3 + 7X4
S.a.:

4X1 + 7X2 - 6X3 + 8X4 <= 40


-2X1 - 3X2 + 7X3 + 9X4 <= 30
6X1 + 9X2 - 5X3 + 6X4 <= 70

 Estandarización:
4X1 + 7X2 − 6X3 + 8X4 + S1 = 40
−2X1 − 3X2 + 7X3 + 9X4 + S2 = 30
6X1 + 9X2 − 5X3 + 6X4 + S3 = 70
Z = −4X1 − 5X2 + 3X3 − 7X4 + 0S1 + 0S2 + 0S3 = 0

BASE X1 X2 X3 X4 S1 S2 S3 LIMITE RAZON


S1 4 7 -6 8 1 0 0 40 5
S2 -2 -3 7 9 0 1 0 30 3.33
S3 6 9 -5 6 0 0 1 70 11.67
Z -4 -5 3 -7 0 0 0 0

FORMULA BASE X1 X2 X3 X4 S1 S2 S3 LIMITE RAZON


(-8÷9) S1 5.78 9.67 -12.22 0 1 -0.89 0 13.33 1.38
(1÷9) X4 -0.22 -0.33 0.78 1 0 0.11 0 3.33 -10
(-6÷9) S3 7.33 11 -9.67 0 0 -0.67 1 50 4.55
-(-7÷9) Z -5.56 -7.33 8.44 0 0 0.78 0 23.33

FORMULA BASE X1 X2 X3 X4 S1 S2 S3 LIMITE RAZON


(1÷9.67) X2 0.60 1 -1.26 0 0.10 -0.09 0 1.38 2.31
-(-0.33÷9.67) X4 -0.02 0 0.36 1 0.03 0.08 0 3.79 -165
(11÷9.67) S3 0.76 0 4.24 0 -1.14 0.34 1 34.83 45.91
-(-7.33÷9.67) Z -1.17 0 -0.83 0 0.76 0.10 0 33.45

FORMULA BASE X1 X2 X3 X4 S1 S2 S3 LIMITE RAZON


(1÷0.60) X1 1 1.67 -2.12 0 0.17 -0.15 0 2.31 -1.09
-(-0.02÷0.60) X4 0 0.04 0.31 1 0.04 0.08 0 3.85 12.5
(-0.76÷ 0.60) S3 0 -1.27 5.85 0 -1.27 0.46 1 33.08 5.66
-(-1.17÷0.60) Z 0 1.96 -3.31 0 0.96 -0.08 0 36.15
FORMULA BASE X1 X2 X3 X4 S1 S2 S3 LIMITE
-(-2.12÷5.58) X1 1 1.21 0 0 -0.29 0.01 0.36 14.28
(-0.31÷5.85) X4 0 0.11 0 1 0.11 0.05 -0.05 2.11
(1÷5.85) X3 0 -0.22 1 0 -0.22 0.08 0.17 5.66
-(-3.31÷5.85) Z 0 1.24 0 0 0.24 0.18 0.57 54.87

You might also like