Scribd Logo
Upload

Welcome to Scribd!

  • 13 views

    Taller #8

    Uploaded by

    Liseth Johana Duarte Jaime
    The document contains three examples of linear programming problems with constraints and objective functions to maximize. Each example provides the coefficients for the decision variables and constraints in a table with the maximum value calculated.

    Copyright:

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

    You might also like

    Taller #8

    Uploaded by

    Liseth Johana Duarte Jaime
    13 views8 pages
    The document contains three examples of linear programming problems with constraints and objective functions to maximize. Each example provides the coefficients for the decision variables and constraints in a table with the maximum value calculated.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains three examples of linear programming problems with constraints and objective functions to maximize. Each example provides the coefficients for the decision variables and constraints in a table with the maximum value calculated.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    13 views8 pages

    Taller #8

    Uploaded by

    Liseth Johana Duarte Jaime
    The document contains three examples of linear programming problems with constraints and objective functions to maximize. Each example provides the coefficients for the decision variables and constraints in a table with the maximum value calculated.

    Copyright:

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

    cj 3 5 0 0 0

    CB B X1 X2 h1 h2 h3 b(i)
    0 h1 1 0 1 0 0 4 #DIV/0!
    0 h2 0 2 0 1 0 12 6
    0 h3 3 2 0 0 1 18 9
    zj 0 0 0 0 0 0
    cj-zj 3 5 0 0 0

    cj 3 5 0 0 0
    CB B X1 X2 h1 h2 h3 b(i)
    0 h1 1 0 1 0 0 4 4
    5 X2 0 1 0 0.5 0 6 #DIV/0!
    0 h3 3 0 0 -1 1 6 2
    zj 0 5 0 2.5 0 30
    cj-zj 3 0 0 -2.5 0

    cj 3 5 0 0 0
    CB B X1 X2 h1 h2 h3 b(i)
    0 h1 0 0 1 0.333 -0.333 2
    5 X2 0 1 0 0.5 0 6
    3 X1 1 0 0 -0.333 0.333 2
    zj 3 5 0 1.5 1 36
    cj-zj 0 0 0 -1.5 -1
    Max z: 3000X1 + 5000X2 + 0h1 + 0h2 + 0h3

    Restricciones:

    Horas disponibles PL1 1X1+0X2+1h1+0h2+0h3=4


    Horas disponibles PL2 0X1+2X2+0h1+1h2+0h3=12
    Horas disponibles PL3 3X1+2X2+0h1+0h2+1h3=18
    Restricción No negatividad
    X1;X2 ≥ 0
    cj 10 15 0 0 0
    CB B X1 X2 h1 h2 h3 b(i)
    0 h1 3 8 1 0 0 360 45
    0 h2 3 2 0 1 0 180 90
    0 h3 3 4 0 0 1 210 52.5
    zj 0 0 0 0 0 0
    cj-zj 10 15 0 0 0

    cj 10 15 0 0 0
    CB B X1 X2 h1 h2 h3 b(i)
    15 X2 0.375 1 0.125 0 0 45 120
    0 h2 3 2 0 1 0 3 1
    0 h3 3 4 0 0 1 3.5 1.167
    zj 5.63 15 1.88 0 0 675
    cj-zj 4.38 0 -1.88 0 0

    cj 10 15 0 0 0
    CB B X1 X2 h1 h2 h3 b(i)
    15 X2 0.38 1 0.125 0 0 45
    10 X1 1 0.67 0 0.33 0 1
    0 h3 3 4 0 0 1 3.5
    zj 15.63 21.67 1.88 3.33 0 685 Z
    cj-zj -5.63 -6.67 -1.88 -3.33 0
    Max Z: 10X1 + 15X2 + 0h1 + 0h2 + 0h3

    Restricciones:
    3X1 + 8X2 + 1h1 + 0h2 + 0h3 = 360
    3X1 + 2X2 + 0h1 + 1h2 + 0h3 = 180
    3X1 + 4X2 + 0h1 + 0h2 +1h3 = 210

    Max Z
    0 0 0

    3 8 0 ≤ 360
    3 2 0 ≤ 180
    3 4 0 ≤ 210
    cj 80 60 0 0 0
    CB B X1 X2 h1 h2 h3 b(i)
    0 h1 80 20 1 0 0 100
    0 h2 68 32 0 1 0 100
    0 h3 0 25 0 0 1 100
    zj 0 0 0 0 0 0
    cj-zj 80 60 0 0 0
    Min Z : 80X1 + 60X2 + 0h1 + 0h2 + 0h3
    0
    0 Restricciones
    0 80X1+20X2+1h1+0h2+0h3=100
    68X1+32X2+0h1+1h2+0h3=100
    0X1+25X2+A1-0h1+oh2+1h3=100
    cj 2 8M 0 0M
    CB B X1 X2 A1 H1 H2 A2 b(i) Factibilidad
    M A1 5 10 1 0 0 0 150 15
    0 H1 1 0 0 1 0 0 20 #DIV/0!
    M A2 0 1 0 0 -1 1 14 14
    zj 5M 11M M 0M -M M 164M
    cj-zj 2-5M 8-11M 0 0 M 0

    cj 2 8 M 0 0 M
    CB B X1 X2 A1 H1 H2 A2 b(i)
    M A1 5 0 1 0 10 -10 10 1
    0 H1 1 0 0 1 0 0 20 #DIV/0!
    8 X2 0 1 0 0 -1 1 14 -14
    zj 5M 8 M 0 10M-8 -10M+8 10M+114
    cj-zj 2-5M 0 0 0 -10M+8 11M-8

    cj 2 8 M 0 0 M
    CB B X1 X2 A1 H1 H2 A2 b(i)
    0 H2 0.5 0 0.1 0 1 -1 1 2
    0 H1 1 0 0 1 0 0 20 20
    8 X2 0.5 1 0.1 0 0 0 15 30
    zj 4 8 0.8 0 0 0 120
    cj-zj -2 0 M-0.8 0 0 M

    cj 2 8 M 0 0 M
    CB B X1 X2 A1 H1 H2 A2 b(i)
    2 X1 1 0 0.2 0 2 -2 2
    0 H1 0 0 -0.2 1 -2 2 18
    8 X2 0 1 0 0 -1 1 14
    zj 2 8 0.4 0 -4 4 116 Z
    cj-zj 0 0 M-0,4 0 4 M-4
    Factibilidad

    No entra el numero negativo

    You might also like