Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Ejercicios Programacion Entera

    Uploaded by

    Daniel Ariza
    The document describes solving two integer linear programming problems using the branch and bound method. The first problem involves maximizing Z = 10x1 + 30x2 subject to the constraints x1 + 5x2 <= 15, 5x1 + x2 <= 15, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3, Z = 90. The second problem involves maximizing Z subject to the constraints 2x1 + x2 <=6, 2x1 + 3x2 <= 9, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3

    Copyright:

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

    You might also like

    Ejercicios Programacion Entera

    Uploaded by

    Daniel Ariza
    7 views5 pages
    The document describes solving two integer linear programming problems using the branch and bound method. The first problem involves maximizing Z = 10x1 + 30x2 subject to the constraints x1 + 5x2 <= 15, 5x1 + x2 <= 15, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3, Z = 90. The second problem involves maximizing Z subject to the constraints 2x1 + x2 <=6, 2x1 + 3x2 <= 9, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3

    Original Description:

    ejercicios programacion entera

    Original Title

    EJERCICIOS PROGRAMACION ENTERA

    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
    The document describes solving two integer linear programming problems using the branch and bound method. The first problem involves maximizing Z = 10x1 + 30x2 subject to the constraints x1 + 5x2 <= 15, 5x1 + x2 <= 15, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3, Z = 90. The second problem involves maximizing Z subject to the constraints 2x1 + x2 <=6, 2x1 + 3x2 <= 9, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3

    Copyright:

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

    Ejercicios Programacion Entera

    Uploaded by

    Daniel Ariza
    The document describes solving two integer linear programming problems using the branch and bound method. The first problem involves maximizing Z = 10x1 + 30x2 subject to the constraints x1 + 5x2 <= 15, 5x1 + x2 <= 15, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3, Z = 90. The second problem involves maximizing Z subject to the constraints 2x1 + x2 <=6, 2x1 + 3x2 <= 9, and x1, x2 >= 0 and integer. The optimal solution is found to be x1 = 0, x2 = 3

    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 5

    EJERCICIOS PROGRAMACION ENTERA grupo 9

    DANIEL ARIZA RIAÑO 20152020921


    NAYIB MORENO 20152020

    maximizar Z = 10x1 + 30x2

    Sujeto a: x1 + 5x2 <= 15


    5x1 + x2 <= 15
    X1, x2 >= 0 y enteros

    iteración 1

    fila Base X1 X2 X3 X4 solución


    1 X3 1 5 1 0 15
    2 X4 5 1 0 1 15
    3 Z 10 30 0 0 0
    Fila 1 por 1/5
    Fila 1 * -1 + fila 2
    Fila 1 * -30 + fila 2

    iteración 2

    Fila Base X1 X2 X3 X4 solución


    1 X2 1/5 1 1/5 0 3
    2 X4 24/5 0 -1/5 -1 12
    3 Z 4 0 6 0 90
    Fila 2 * 5/24 = (24/5*5/24, 0*5/24, -1/5*5/24, -1*5/24, 12*5/24) = (1, 0, -1/24, 5/24, 5/2)
    Fila 2 * -1/5 + fila 1 = (0, 1, 5/24, -1/24, 5/2)
    Fila 2 * -4 + fila 3 = (0, 0, 35/6, 5/6, 100)

    iteración 3

    Fila Base X1 X2 X3 X4 solución


    1 X2 0 1 5/24 -1/24 5/2
    2 X1 1 0 -1/24 5/24 5/2
    3 Z 0 0 35/6 5/6 100
    BRANCH AND BOUND

    P0
    X1 = 5/2
    X2 = 5/2
    Z = 100
    X2 <=2 X2 >= 3
    x1 + 5x2 <= 15 x1 + 5x2 <= 15
    5x1 + x2 <= 15 P1 P2 5x1 + x2 <= 15
    X1, x2 >= 0 X2 = 2 X2 = 3 X1, x2 >= 0
    X2 <= 2 X1 = 13/5 X1 = 0 X2 >= 3
    SI X2 = 2 Z = 86 Z = 90 SI X2 = 3
    X1 <= 13/5 X1 = 12/5
    X1 <= 5 X1 = 0
    Z = 86 Z = 90

    P1
    X2 = 2
    X1 = 13/5
    Z = 83
    X1 <=2 X1 >= 3
    x1 + 5x2 <= 15 x1 + 5x2 <= 15
    5x1 + x2 <= 15 P3 P4 5x1 + x2 <= 15
    X1, x2 >= 0 X1 =2 X1 =3 X1, x2 >= 0
    X1 <=2 X2 = 2 X2 = 2 X1 >= 3
    SI X1 = 2 Z = 60 Z = 70 SI X1 = 3
    X2 <= 5 X2 = 0
    X2 <= 13/5 X2 = 12/5
    X2 <= 2 X2 <= 2
    Z = 60 Z = 70

    SOLUCION DADA EN P2

    X1 = 0
    X2=3
    Z = 90
    2.

    Y enteros
    BRANCH AND BOUND

    P0
    X1 = 9/4
    X2 = 3/2
    Z = 51/4
    X1 <=2 X1>= 3

    2x1 + x2 <=6 P1 P2 2x1 + x2 <= 6


    2x1 + 3x2 <= 9 X1 = 2 X2 = 3 2x1 + 3x2 <= 9
    X1 <= 2 X1 = 5/3 X1 = 0 x1 >= 3
    Si X1 = 2 Z = 12.667 Z=9 SI X1 = 3
    X2 <= 2 X2 <= 0
    X2 <= 5/3 X2 <= 1

    Z = 12.667 Z=9

    P1
    X1 = 2
    X2 = 5/3
    Z = 12.667
    X2<=1 X2 >= 2
    P4
    2x1 + x2 <=6 P3 2x1 + x2 <=6
    X2 = 2
    2x1 + 3x2 <= 9 X2 = 2 2x1 + 3x2 <= 9
    X1 = 3/2
    X2 <= 1 X1 = 1 X2 >= 2
    SI X2 = 1 Z = 12.5 SI X2 = 2
    Z = 10
    X1 = 2 X1 <= 2
    X1 <= 5/2 X1 <= 3/2
    X1 <=3 X1 <= 2
    Z = 37/3 Z = 12.5

    P4
    X2 = 2
    X1 = 3/2
    Z = 12.5
    X1 <=1 X1 >= 2

    2x1 + x2 <=6 P5 P6 2x1 + x2 <=6


    2x1 + 3x2 <= 9 X2 = 7/3 X2 = ? 2x1 + 3x2 <= 9
    X1 <= 1 X1 = 1 X1 = 2 X1 >= 2
    SI X1 = 1 Z = 37/3 Z = no factible SI X1 = 1
    X2 <= 4 X2 <= 2
    X2 <= 7/3 X2 <= 5/3
    X2>=2 X2 >= 2
    P5
    X2 = 7/3
    X1 = 1
    Z = 37/3
    X2<=2 X2 >=3

    P6 P7
    2x1 + x2 <=6 2x1 + x2 <=6
    X2 = 2 X2 = 3
    2x1 + 3x2 <= 9 2x1 + 3x2 <= 9
    X1 = 1 X1 = 0
    X2 <= 2 X2 >= 3
    Z = 11 Z = 12
    SI X2 = 2 SI X2 = 3
    X1 <= 2 X1 <= 3/2
    X1 <= 3/2 X1 <= 0
    X1 <= 1 X1 >= 2

    Z = 11 Z = 12

    SOLUCION DADA EN P7
    X1 = 0
    X2=3
    3X1 + 4X2 = Z, 0 + 12 = Z, Z = 12

    You might also like