Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Ejercicio Propuesto

    Uploaded by

    Deybi Chávez Sú
    This document describes a linear programming problem with the objective of maximizing Z=3x1+2x2-2x3 subject to the constraints 2x1+2x2+1x3≤10 and -2x1+1x2-2x3≤5, with non-negativity constraints. The simplex method is applied, with the pivot element chosen in each iteration. The optimal solution found is x1=1.5, x2=0, x3=0, with Z=15.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Ejercicio Propuesto

    Uploaded by

    Deybi Chávez Sú
    8 views8 pages
    This document describes a linear programming problem with the objective of maximizing Z=3x1+2x2-2x3 subject to the constraints 2x1+2x2+1x3≤10 and -2x1+1x2-2x3≤5, with non-negativity constraints. The simplex method is applied, with the pivot element chosen in each iteration. The optimal solution found is x1=1.5, x2=0, x3=0, with Z=15.

    Original Description:

    Original Title

    EJERCICIO PROPUESTO

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a linear programming problem with the objective of maximizing Z=3x1+2x2-2x3 subject to the constraints 2x1+2x2+1x3≤10 and -2x1+1x2-2x3≤5, with non-negativity constraints. The simplex method is applied, with the pivot element chosen in each iteration. The optimal solution found is x1=1.5, x2=0, x3=0, with Z=15.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    8 views8 pages

    Ejercicio Propuesto

    Uploaded by

    Deybi Chávez Sú
    This document describes a linear programming problem with the objective of maximizing Z=3x1+2x2-2x3 subject to the constraints 2x1+2x2+1x3≤10 and -2x1+1x2-2x3≤5, with non-negativity constraints. The simplex method is applied, with the pivot element chosen in each iteration. The optimal solution found is x1=1.5, x2=0, x3=0, with Z=15.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 8

    Función objetivo:

    Z= 3 x 1+2 x 2−2 x3
    Restricciones:
    2 x1 +2 x 2+1 x 3 ≤ 10

    −2 x1 +1 x 2−2 x 3 ≤5

    x 1 ≥ 0 , x2 ≥ , x 3 ≥0

    Maximizar
    Z= 3 x 1+2 x 2−2 x3 +0 S1 +0 S2

    2 x1 +2 x 2+1 x 3+ 1 S1 +0 S2=10

    −2 x1 +1 x 2−2 x 3 +0 S1 +1 S 2=5

    x 1 ≥ 0 , x2 ≥ , x 3 ≥0 , S1 , S 2 ≥ 0
    Matriz inicial:
    Cj 3 2 -2 0 0
    x1 x2 x3 S1 S2 R
    0 S1 2 2 1 1 0 10
    0 S2 -2 1 -2 0 1 5
    Zj 0 0 0 0 0 0
    Cj-Zj 3 2 -2 0 0

    Primera iteración:
    Elección de la columna pivote.
    Cj 3 2 -2 0 0
    x1 x2 x3 S1 S2 R
    0 S1 2 2 1 1 0 10
    0 S2 -2 1 -2 0 1 5
    Zj 0 0 0 0 0 0
    Cj-Zj 3 2 -2 0 0

    10/2 = 5
    5/-2= -2.5
    Encontrar el elemento pivote.
    Elemento pivote “2”.

    Segunda iteración:
    Cj 3 2 -2 0 0
    x1 x2 x3 S1 S2 R
    0 S1 1 1 1/2 1/2 0 5 ½ R1
    0 S2 -2 1 -2 0 1 5
    Zj 0 0 0 0 0
    Cj-Zj 3 2 -2 0 0
    Tercera iteración:
    Cj 3 2 -2 0 0
    x1 x2 x3 S1 S2 R
    3 x1 1 1 1/2 1/2 0 5
    S2 2 R1+R2
    0 0 3 -1 1 1 15
    Zj 3 3 3/2 3/2 0 15
    Cj-Zj 0 -1 -7/2 -3/2 0

    Ahora se analiza, el C j−Z j sean menores o iguales a 0.


    Resultados:
    x 1=5

    x 2=0

    x 3=0

    Z=15
    Utilizando el método dual:

    Min Z= 10 x 1+5 x 2

    2 x1 −2 x 2 ≥ 3

    2 x1 + x 2 ≥ 2

    1 x1−2 x 2 ≥−2

    2 x1 −2 x 2=3

    2 x1 + x 2=2

    −1 x1 +2 x 2=2

    Min Z= 10 x 1+5 x 2+ 0 S 4 + M A 4 +0 S5 + M A 6 +0 S 7

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 2 -2 -1 0 0 1 0 3
    M A6 2 1 0 -1 0 0 1 2
    0 S5 -1 2 0 0 1 0 0 2
    Zj 4M -M -M -M 0 M M 5M
    Cj-Zj 4M- 5+M M 0 0 0 -M
    10
    Columna pivote.

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 2 -2 -1 0 0 1 0 3
    M A6 2 1 0 -1 0 0 1 2
    0 S5 -1 2 0 0 1 0 0 2
    Zj 4M -M -M -M 0 M M 5M
    Cj-Zj 10- 5+M M 0 0 0 -M
    4M

    Elemento pivote
    3/2 = 1.5
    2/2=1
    2/-1=-2

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 2 -2 -1 0 0 1 0 3
    M A6 2 1 0 -1 0 0 1 2
    0 S5 -1 2 0 0 1 0 0 2
    Zj 4M -M -M -M 0 M M 5M
    Cj-Zj 10- 5+M M 0 0 0 -M
    4M

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    R1 M A4 2 -2 -1 0 0 1 0 3
    R2 M A6 2 1 0 -1 0 0 1 2 ½ R2
    R3 0 S5 -1 2 0 0 1 0 0 2
    Zj 4M -M -M -M 0 M M 5M
    Cj-Zj 10- 5+M M 0 0 0 -M
    4M
    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 2 -2 -1 0 0 1 0 3
    M A6 1 ½ 0 -1/2 0 0 1/2 1
    0 S5 -1 2 0 0 1 0 0 2 R2+R3
    Zj 4M -M -M -M 0 M M 5M
    Cj-Zj 10- 5+M M 0 0 0 -M
    4M

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 2 -2 -1 0 0 1 0 3
    M A6 1 ½ 0 -1/2 0 0 1/2 1
    0 S5 0 5/2 0 -1/2 1 0 1/2 3
    Zj 4M -M -M -M 0 M M 5M
    Cj-Zj 10- 5+M M 0 0 0 -M
    4M

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 0 -3 -1 1 0 1 -1 1 -2R2+R1
    10 A6 1 ½ 0 -1/2 0 0 1/2 1
    0 S5 0 5/2 0 -1/2 1 0 1/2 3
    Zj 10 -3M+5 -M M-5 0 M -M+5 M+10
    Cj-Zj 0 3M M 5 0 0 M-5

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 0 -3 -1 1 0 1 -1 1
    10 A6 1 ½ 0 -1/2 0 0 1/2 1
    0 S5 0 5/2 0 -1/2 1 0 1/2 3
    Zj 10 -3M+5 -M M-5 0 M -M+5 M+10
    Cj-Zj 0 3M M 5 0 0 M-5
    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 0 -3 -1 1 0 1 -1 1
    10 A6 1 ½ 0 -1/2 0 0 1/2 1
    0 S5 0 5/2 0 -1/2 1 0 1/2 3
    Zj 10 -3M+5 -M M-5 0 M -M+5 M+10
    Cj-Zj 0 3M M 5 0 0 M-5

    Elección de la columna pivote.


    1/1=1
    1/-1/2=-1/5
    3/-1/2= -3/2
    elección del elemento pivote.

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 0 -3 -1 1 0 1 -1 1
    10 A6 1 ½ 0 -1/2 0 0 1/2 1
    0 S5 0 5/2 0 -1/2 1 0 1/2 3
    Zj 10 -3M+5 -M M-5 0 M -M+5 M+10
    Cj-Zj 0 3M M 5 0 0 M-5

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 0 -3 -1 1 0 1 -1 1 1/2R1+R2
    10 A6 1 -1 -1/2 0 0 1/2 0 3/2
    0 S5 0 5/2 0 -1/2 1 0 1/2 3
    Zj 10 -3M+5 -M M-5 0 M -M+5 M+10
    Cj-Zj 0 3M M 5 0 0 M-5
    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    M A4 0 -3 -1 1 0 1 -1 1
    10 A6 1 -1 -1/2 0 0 1/2 0 3/2
    0 S5 0 1 -1/2 0 1 1/2 0 7/2 1/2R1+R3
    Zj 10 -3M+5 -M M-5 0 M -M+5 M+10
    Cj-Zj 0 3M M 5 0 0 M-5

    Cj 10 5 0 M 0 M 0
    x1 x2 S3 A3 S5 A6 S7 R
    0 A4 0 -3 -1 1 0 1 -1 1
    10 x2 1 -1 -1/2 0 0 1/2 0 3/2
    0 S7 0 1 -1/2 0 1 1/2 0 7/2
    Zj 10 -10 -5 0 0 5 0 15
    Cj-Zj 0 15 5 M 0 M-5 0

    Cj-Zj≥ 0

    Resultados:
    x 1=¿ 1.5

    x 2=¿0

    x 3=¿0

    Z=15

    You might also like