Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    SIMPLEX

    Uploaded by

    Daniel Enrique Jimenez Paiva
    The document describes using the simplex method and branch and bound method to solve a linear programming optimization problem with the objective of maximizing Z=2X1+X2 subject to multiple constraints. It shows the iterations of the simplex method, arriving at the optimal solution of Z=31/4, X1=11/4, X2=9/4. It then applies branch and bound, dividing the problem into subproblems based on constraints and bounds on X1 and X2, and solving each subproblem to find the optimal solution of Z=7.33, X1=3.17, X2=1.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    SIMPLEX

    Uploaded by

    Daniel Enrique Jimenez Paiva
    32 views4 pages
    The document describes using the simplex method and branch and bound method to solve a linear programming optimization problem with the objective of maximizing Z=2X1+X2 subject to multiple constraints. It shows the iterations of the simplex method, arriving at the optimal solution of Z=31/4, X1=11/4, X2=9/4. It then applies branch and bound, dividing the problem into subproblems based on constraints and bounds on X1 and X2, and solving each subproblem to find the optimal solution of Z=7.33, X1=3.17, X2=1.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes using the simplex method and branch and bound method to solve a linear programming optimization problem with the objective of maximizing Z=2X1+X2 subject to multiple constraints. It shows the iterations of the simplex method, arriving at the optimal solution of Z=31/4, X1=11/4, X2=9/4. It then applies branch and bound, dividing the problem into subproblems based on constraints and bounds on X1 and X2, and solving each subproblem to find the optimal solution of Z=7.33, X1=3.17, X2=1.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    32 views4 pages

    SIMPLEX

    Uploaded by

    Daniel Enrique Jimenez Paiva
    The document describes using the simplex method and branch and bound method to solve a linear programming optimization problem with the objective of maximizing Z=2X1+X2 subject to multiple constraints. It shows the iterations of the simplex method, arriving at the optimal solution of Z=31/4, X1=11/4, X2=9/4. It then applies branch and bound, dividing the problem into subproblems based on constraints and bounds on X1 and X2, and solving each subproblem to find the optimal solution of Z=7.33, X1=3.17, X2=1.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 4

    MAX Z = 2X1 + X2 Z-2X1-X2=0 SIMPLEX ≤

    Sujeto a:

    X1 + x2 ≤ 5 X1+X2+X3=5

    -x1 + x2 ≤ 0 -X1+X2+X4=0

    6x1 +2x2 ≤ 21 6X1+2X2+X5=21

    1RA ITERACION

    BASE X1 X2 X3 X4 X5 SOLUCION
    Z -2 -1 0 0 0 0
    X3 1 1 1 0 0 5
    X4 -1 1 0 1 0 0
    X5 6 2 0 0 1 21

    2DA ITERACION

    BASE X1 X2 X3 X4 X5 SOLUCION
    Z 0 -1/3 0 0 1/3 21/3
    X3 0 2/3 1 0 -1/6 3/2
    X4 0 4/3 0 1 1/6 21/6
    X1 1 1/3 0 0 1/6 21/6

    3RA ITERACION

    BASE X1 X2 X3 X4 X5 SOLUCION
    Z 0 0 ½ 0 ¼ 31/4
    X2 0 1 3/2 0 -1/4 9/4
    X4 0 0 -2 1 ½ ½
    X1 1 0 -1/2 0 ¼ 11/4

    Z=31/4 X1= 11/4 X2=9/4 SOLUCION RELAJADA U OPTIMA


    METODO DE RAMIFICACION Y ACOTAMIENTO

    SUBPROBLEMA 1

    X1= 2.75 TENEMOS DOS SOLUCIONES: 2 ≥ X1 ≤3

    X1 ≤ 2 SUBPROLBLEMA 2

    X1 ≥ 3 SUBPROBLEMA 3

    SUBPROBLEMA 2

    PARA X1 ≤ 2 TENDRIAMOS:

    MAX Z = 2X1 + X2
    Sujeto a:
    X1 + x2 ≤ 5
    -x1 + x2 ≤ 0
    6x1 +2x2 ≤ 21
    X1 ≤ 2

    Z=6 X1=2 x2=2

    SUBPROBLEMA 3

    MAX Z = 2X1 + X2

    Sujeto a:
    X1 + x2 ≤ 5

    -x1 + x2 ≤ 0

    6x1 +2x2 ≤ 21
    X1 ≥3

    Z=7.5 X1=3 X2=1.5


    SUBPROBLEMA 4

    PARA X2=1.5 TENEMOS: X2≤1 X2≥2

    MAX Z = 2X1 + X2
    Sujeto a:
    X1 + x2 ≤ 5
    -x1 + x2 ≤ 0
    6x1 +2x2 ≤ 21
    X1 ≥3
    X2≤1

    X1= 3.17 X2=1 Z=7.33

    SUBPROBLEMA 5

    MAX Z = 2X1 + X2
    Sujeto a:
    X1 + x2 ≤ 5
    -x1 + x2 ≤ 0
    6x1 +2x2 ≤ 21
    X1 ≥3
    X2≥2

    Solución no fatible

    SUBPROBLEMA 6

    MAX Z = 2X1 + X2
    Sujeto a:
    X1 + x2 ≤ 5
    -x1 + x2 ≤ 0
    6x1 +2x2 ≤ 21
    X1 ≥3
    X2≤1

    X1≤3

    X1 =3 x2=1 Z=7
    SUBPROBLEMA 7

    MAX Z = 2X1 + X2
    Sujeto a:
    X1 + x2 ≤ 5
    -x1 + x2 ≤ 0
    6x1 +2x2 ≤ 21
    X1 ≥3
    X2≤1

    X1≥4

    Solución no factible

    You might also like