Scribd Logo
Upload

Welcome to Scribd!

  • 32 views

    Dual Primal

    Uploaded by

    Juan Cardozo
    The document describes two linear programming problems. The first problem seeks to maximize Z=3X1+2X2 subject to three constraints. The optimal solution is found to be X1=3, X2=12, with maximum value of Z=33. The second problem seeks to minimize Z=2X1+3X2 subject to three constraints. The optimal solution is found to be X1=5, X2=5, with minimum value of Z=25.

    Copyright:

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

    You might also like

    Dual Primal

    Uploaded by

    Juan Cardozo
    32 views2 pages
    The document describes two linear programming problems. The first problem seeks to maximize Z=3X1+2X2 subject to three constraints. The optimal solution is found to be X1=3, X2=12, with maximum value of Z=33. The second problem seeks to minimize Z=2X1+3X2 subject to three constraints. The optimal solution is found to be X1=5, X2=5, with minimum value of Z=25.

    Original Description:

    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 two linear programming problems. The first problem seeks to maximize Z=3X1+2X2 subject to three constraints. The optimal solution is found to be X1=3, X2=12, with maximum value of Z=33. The second problem seeks to minimize Z=2X1+3X2 subject to three constraints. The optimal solution is found to be X1=5, X2=5, with minimum value of Z=25.

    Copyright:

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

    Dual Primal

    Uploaded by

    Juan Cardozo
    The document describes two linear programming problems. The first problem seeks to maximize Z=3X1+2X2 subject to three constraints. The optimal solution is found to be X1=3, X2=12, with maximum value of Z=33. The second problem seeks to minimize Z=2X1+3X2 subject to three constraints. The optimal solution is found to be X1=5, X2=5, with minimum value of Z=25.

    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 2

    Problema 1

    Maximizar Z = 3 X
    1
    + 2 X
    2

    Sujeta a 4 X
    1
    + 2 X
    2
    36
    4 X
    1
    + 6 X
    2
    84
    6 X
    1
    + 2 X
    2
    48
    Con X
    1
    , X
    2
    0
    Solucin
    Forma estndar
    Maximizar Z = 3 X
    1
    + 2 X
    2

    Sujeta a 4 X
    1
    + 2 X
    2
    + 1 X
    3
    = 36
    4 X
    1
    + 6 X
    2
    + 1 X
    4
    = 84
    6 X
    1
    + 2 X
    2
    + 1 X
    5
    = 48
    Con X
    1
    , X
    2
    , X
    3
    , X
    4
    , X
    5
    0

    Tabla N 1
    C
    j
    3 2 0 0 0
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    Valor
    Z
    j
    0 0 0 0 0
    Z
    j
    -C
    j
    -3 -2 0 0 0 0
    0 X
    3
    4 2 1 0 0 36
    0 X
    4
    4 6 0 1 0 84
    0 X
    5
    (6) 2 0 0 1 48
    Variable de entrada: X
    1
    Variable de salida: X
    5


    Tabla N 2
    C
    j
    3 2 0 0 0
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    Valor
    Z
    j
    3 1 0 0 1/2
    Z
    j
    -C
    j
    0 -1 0 0 1/2 24
    0 X
    3
    0 (2/3) 1 0 -2/3 4
    0 X
    4
    0 14/3 0 1 -2/3 52
    3 X
    1
    1 1/3 0 0 1/6 8
    Variable de entrada: X
    2
    Variable de salida: X
    3


    Tabla N 3
    C
    j
    3 2 0 0 0
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    Valor
    Z
    j
    3 2 1.5 0 -0.5
    Z
    j
    -C
    j
    0 0 1.5 0 -0.5 30
    2 X
    2
    0 1 1.5 0 -1 6
    0 X
    4
    0 0 -7 1 (4) 24
    3 X
    1
    1 0 -0.5 0 0.5 6
    Variable de entrada: X
    5
    Variable de salida: X
    4


    Tabla N 4
    C
    j
    3 2 0 0 0
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    Valor
    Z
    j
    3 2 0.625 0.125 0
    Z
    j
    -C
    j
    0 0 0.625 0.125 0 33
    2 X
    2
    0 1 -0.25 0.25 0 12
    0 X
    5
    0 0 -1.75 0.25 1 6
    3 X
    1
    1 0 0.375 -0.125 0 3
    Solucin ptima: X
    1
    = 3, X
    2
    = 12. Valor ptimo de la funcin objetivo: Z = 33.
    Problema 2
    Minimizar Z = 2 X
    1
    + 3 X
    2

    Sujeta a 0.5 X
    1
    + 0.25 X
    2
    4
    1 X
    1
    + 3 X
    2
    20
    1 X
    1
    + 1 X
    2
    = 10
    Con X
    1
    , X
    2
    0
    Solucin
    Forma estndar
    Maximizar Z = - 2 X
    1
    - 3 X
    2
    - M X
    5
    - M X
    6

    Sujeta a 0.5 X
    1
    + 0.25 X
    2
    + 1 X
    3
    = 4
    1 X
    1
    + 3 X
    2
    - 1 X
    4
    + 1 X
    5
    = 20
    1 X
    1
    + 1 X
    2
    + 1 X
    6
    = 10
    Con X
    1
    , X
    2
    , X
    3
    , X
    4
    , X
    5
    , X
    6
    0

    Tabla N 1
    C
    j
    -2 -3 0 0 -M -M
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    X
    6
    Valor
    Z
    j
    -2M -4M 0 M -M -M
    Z
    j
    -C
    j
    -2M + 2 -4M + 3 0 M 0 0 -30M
    0 X
    3
    1/2 1/4 1 0 0 0 4
    -M X
    5
    1 (3) 0 -1 1 0 20
    -M X
    6
    1 1 0 0 0 1 10
    Variable de entrada: X
    2
    Variable de salida: X
    5


    Tabla N 2
    C
    j
    -2 -3 0 0 -M -M
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    X
    6
    Valor
    Z
    j
    -2M/3 - 1 -3 0 -1M/3 + 1 1M/3 - 1 -M
    Z
    j
    -C
    j
    -2M/3 + 1 0 0 - 1M/3 + 1 4M/3 - 1 0 -10M/3 - 20
    0 X
    3
    5/12 0 1 1/12 -1/12 0 7/3
    -3 X
    2
    1/3 1 0 -1/3 1/3 0 20/3
    -M X
    6
    (2/3) 0 0 1/3 -1/3 1 10/3
    Variable de entrada: X
    1
    Variable de salida: X
    6


    Tabla N 3
    C
    j
    -2 -3 0 0 -M -M
    C.B. V.B. X
    1
    X
    2
    X
    3
    X
    4
    X
    5
    X
    6
    Valor
    Z
    j
    -2 -3 0 1/2 -1/2 -3/2
    Z
    j
    -C
    j
    0 0 0 1/2 M - 1/2 M - 3/2 -25
    0 X
    3
    0 0 1 -1/8 1/8 -5/8 1/4
    -3 X
    2
    0 1 0 -1/2 1/2 -1/2 5
    -2 X
    1
    1 0 0 1/2 -1/2 3/2 5

    Solucin ptima: X
    1
    = 5, X
    2
    = 5. Valor ptimo de la funcin objetivo: Z = 25.

    You might also like