Scribd
Upload
7 views7 pages

Optimización de Recursos y Solución Matemática

The document presents a linear programming problem aimed at maximizing the objective function Z, subject to several constraints involving variables x1, x2, x3, x4, and x5. The optimal solution yields values for these variables and a maximum Z value of 220000. Additionally, a dual problem is formulated with its own constraints and optimal solution, also resulting in Z=220000.

Uploaded by

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

Optimización de Recursos y Solución Matemática

The document presents a linear programming problem aimed at maximizing the objective function Z, subject to several constraints involving variables x1, x2, x3, x4, and x5. The optimal solution yields values for these variables and a maximum Z value of 220000. Additionally, a dual problem is formulated with its own constraints and optimal solution, also resulting in Z=220000.

Uploaded by

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

𝑀𝑎𝑥.

𝑧= 〖 2000𝑥 〗 _1+ 〖 1000𝑥 〗 _2+ 〖 0𝑥 〗 _3+


〖 0𝑥 〗 _4+ 〖 0𝑥 〗 _5

s.a 〖 3𝑥 〗 _1+ 〖 𝑥〗 _2 + 〖 𝑥〗 _3 = 300

〖 𝑥〗 _1+ 〖 𝑥〗 _2 + 〖 𝑥〗 _4 = 140

〖 𝑥〗 _1+ 〖 3𝑥 〗 _2 + 〖 𝑥〗 _5 =
300

𝑥_1,𝑥_2 〖 , 𝑥 〗 _3 ,𝑥_4 ,𝑥_5 ≥ 0

TABLA INICIAL

CJ 2000 1000 0 0 0
Vb X1 X2 X3 X4 X5 Xb
0 X3 3 1 1 0 0 300
0 X4 1 1 0 1 0 140
0 X5 1 3 0 0 1 300
ZIJ - CJ -2000 -1000 0 0 0 0

CJ 2000 1000 0 0 0
Vb X1 X2 X3 X4 X5 Xb
2000 X1 1 1/3 1/3 0 0 100
0 X4 0 2/3 - 1/3 1 0 40
0 X5 0 2 2/3 - 1/3 0 1 200
ZIJ - CJ 0 -333 1/3 666 2/3 0 0 200000

CJ 2000 1000 0 0 0
Vb X1 X2 X3 X4 X5 Xb
2000 X1 1 0 1/2 - 1/2 0 80
1000 X2 0 1 - 1/2 1 1/2 0 60
0 X5 0 0 1 -4 1 40
ZIJ - CJ 0 0 500 500 0 220000

SOLUCION OPTIMA
X1 80
X2 60
X3 0
X4 0
X5 40
Z= 220000
COCIENTE
100
140
300

MULTIPLICAR POR 1/3

COCIENTE
300 PIVOTE
60
75

MULTIPLICAR POR 3/2

PIVOTE
Min G = 300Y1 +140Y2 +300Y3 +0Y4 + MY5 + 0Y6 + MY7
s.a 3Y1 + Y2 +Y3 - Y4 +Y5 = 2000
Y1 + Y2 + 3Y3 - Y6 + Y7 = 1000
Y1,Y2,Y3,Y4,Y5,Y6,Y7 ≥ 0

TABLA INICIAL

CJ 300 140 300 0 M 0


Vb Y1 Y2 Y3 Y4 Y5 Y6
M Y5 3 1 1 -1 1 0
M Y7 1 1 3 0 0 -1
Gij – Cj 4M-300 2M-140 4M-300 -M 0 -M

CJ 300 140 300 0 M 0


Vb Y1 Y2 Y3 Y4 Y5 Y6
300 Y1 1 1/3 1/3 - 1/3 1/3 0
M Y7 0 2/3 2 2/3 1/3 - 1/3 -1
Gij – Cj 0 2/3M-40 2 2/3-200 1/3M-100 -4/3M+100 -M

CJ 300 140 300 0 M 0


Vb Y1 Y2 Y3 Y4 Y5 Y6
300 Y1 1 1/4 0 - 3/8 3/8 1/8
300 Y3 0 1/4 1 1/8 - 1/8 - 3/8
Gij – Cj 0 10 0 -75 -M+75 -75

CJ 300 140 300 0 M 0


Vb Y1 Y2 Y3 Y4 Y5 Y6
300 Y1 1 0 -1 - 1/2 1/2 1/2
140 Y2 0 1 4 1/2 - 1/2 -1 1/2
Gij – Cj 0 0 -40 -80 -M+80 -60

SOLUCION OPTIMA
Y1 500

Y2 500

Y3 0

Y4 0

Y5 0

Y6 0

Y7 0
Z= 220000
M
Y7 YB COCIENTE
0 2000 666.666667
1 1000 1000
0 3000M

MULTIPLICAR PO 1/3

M
Y7 YB COCIENTE
0 666 2/3 2000 PIVOTE
1 333 1/3 125
0 333 1/3M+200000

MULTIPLICAR POR 3/8


M
Y7 YB COCIENTE
- 1/8 625 2500
3/8 125 500 PIVOTE
-M+75 225000

MULTIPLICAR POR 4
M
Y7 YB
- 1/2 500
1 1/2 500
-M+60 220000

You might also like