Documente Academic
Documente Profesional
Documente Cultură
Alumno
Pérez Tinoco Alexis Jordano
Materia
Programación Lineal Aplicada
Boleta
2015601712
Secuencia
2NV41
Profesor
Montero Oropeza Adán
b. Método Simplex:
𝑋1 𝑋2 H1 H2
0 𝐻2 2 1 0 1 100 100
=50
2
Zj 0 0 0 0 0
Cj – Zj 7 5 0 0
4 − [(4)(1)] = 0
1
3 − [(4) ( )] = 1
2
1 − [(4)(0)] = 1
1
0 − [(4) ( )] = −2
2
240 − [(4)(50)] = 40
𝑋1 𝑋2 H1 H2
1
1 − [( ) (0)] = 1
2
1 1
− [( ) (1)] = 0
2 2
1 1
0 − [( ) (1)] = −
2 2
1 1 3
− [( ) (−2)] =
2 2 2
1
50 − [( ) (40)] = 30
2
𝑋1 𝑋2 H1 H2
Cj base 7 5 0 0 L.D
5 𝑋2 0 1 1 -2 40
7 𝑋1 1 0 1 3 30
−
2 2
Zj 7 5 3 1 410
2 2
Cj – Zj 0 0 3 1
− −
2 2
c. Comprobación:
𝑀𝑎𝑥 𝑧 = 7(30) + 5(40)
4(30) + 3(40) ≤ 240
2(30) + 40 ≤ 100
2. De Primal a Dual:
𝑋1 𝑋2 R1 R2
(100) 0 𝑅2 3 1 0 1 5 5
3
=1.6
Zj 0 0 0 0 0
Zj – Cj -460 -200 0 0
4 − [(4)(1)] = 0
1 2
2 − [(4) ( )] =
3 3
1 − [(4)(0)] = 1
1 4
0 − [(4) ( )] = −
3 3
5 1
7 − [(4) ( )] =
3 3
𝑋1 𝑋2 R1 R2
Zj – Cj 0 -46.66 0 153.33
1
1 − [( ) (0)] = 1
3
1 1
− [( ) (1)] = 0
2 3
1 1
0 − [( ) (1)] = −
3 2
1 1 3
− [( ) (−2)] =
2 3 2
1
50 − [( ) (40)] = 30
3
𝑋1 𝑋2 H1 H2
Cj base 7 5 0 0 L.D
5 𝑋2 0 1 1 -2 40
7 𝑋1 1 0 1 3 30
−
2 2
Zj 7 5 3 1 410
2 2
Cj – Zj 0 0 3 1
− −
2 2
c. Comprobación:
𝑀𝑎𝑥 𝑧 = 7(30) + 5(40)
4(30) + 3(40) ≤ 240
2(30) + 40 ≤ 100
1. Dual – Primal