Scribd Logo
Upload

Welcome to Scribd!

  • Tarea Simplex Minimizacion

    Uploaded by

    Jhoel Alan Huaraca Núñez
    13 views2 pages
    The document contains three examples of linear programming problems. Each example provides the objective function coefficients and constraint coefficients for a linear program with four variables. The third example solves for the values of the variables x1, x2, and x3 that minimize the objective function Z.

    Original Description:

    Original Title

    tarea simplex minimizacion

    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. Each example provides the objective function coefficients and constraint coefficients for a linear program with four variables. The third example solves for the values of the variables x1, x2, and x3 that minimize the objective function Z.

    Copyright:

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

    Tarea Simplex Minimizacion

    Uploaded by

    Jhoel Alan Huaraca Núñez
    The document contains three examples of linear programming problems. Each example provides the objective function coefficients and constraint coefficients for a linear program with four variables. The third example solves for the values of the variables x1, x2, and x3 that minimize the objective function Z.

    Copyright:

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

    Cj M 0 0

    B x7 X5 X6
    M x7 50 1 0 0
    0 X5 20 0 1 0
    0 X6 30 0 0 1
    Zj 50M M 0 0
    Zj-Cj …….. 0 0 0

    Cj M 0 0
    B x7 X5 X6
    M x7 10 1 -2 0
    2 x2 20 0 1 0
    0 X6 90 0 3 1
    Zj 40+20M M 2-2M 0
    Zj-Cj …….. 0 2-2M 0

    Cj M 0 0
    B x7 X5 X6
    5 X1 1.11 0.11 - 0.22 -
    2 x2 24.44 0.44 0.11 -
    0 X6 104.44 1.44 0.11 1.00
    Zj 54.44 1.44 - 0.89 -
    Zj-Cj …….. 1.44 - M - 0.89 -

    Entonces
    x1 = 1.11
    x2 = 24.44 => min(Z) = 5x1+2x2+4x3
    x3 = 0 min(Z) = 5*(1.11) + 2*(24.44) +4(0)
    min(Z) =
    5 2 4 0
    x1 x2 x3 x4
    1 2 2 -1 25
    -4 1 -1 -1 20 valor positivo
    -1 -3 1 -1 -10
    M 2M 2M -M
    M-5 2M-2 2M-4 -M

    5 2 4 0
    x1 x2 x3 x4
    9 0 4 1 1.11111111
    -4 1 -1 -1 -5
    -13 0 -2 -4 -6.92307692
    9M-8 2 4M-2 M-2
    9M-13 0 4M-6 M-2

    5 2 4 0
    x1 x2 x3 x4
    1.00 - 0.44 0.11
    - 1.00 0.78 - 0.56
    - - 3.78 - 2.56
    5.00 2.00 3.78 - 0.56
    - - - 0.22 - 0.56

    min(Z) = 5x1+2x2+4x3
    min(Z) = 5*(1.11) + 2*(24.44) +4(0)
    54.43

    You might also like