Scribd Logo
Upload

Welcome to Scribd!

  • Ayudantia 3

    Uploaded by

    cperez
    17 views4 pages
    The document provides steps to solve two linear programming optimization problems. The first problem maximizes z = 3x1 + 8x2 subject to the constraints 2x1 + 3x2 + h1 = 40 and 4x1 + 8x2 + h2 = 10 with non-negativity conditions. Using the simplex method, the optimal solution is found to be h1 = 36.25, x1 = h2 = 0, x2 = 1.25, z = 10. The second problem minimizes z = x1 - 2x2 subject to the constraints 9x1 + 5x2 ≤ 15 and 5x1 + x2 ≤ 4 with non-negativity conditions

    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 provides steps to solve two linear programming optimization problems. The first problem maximizes z = 3x1 + 8x2 subject to the constraints 2x1 + 3x2 + h1 = 40 and 4x1 + 8x2 + h2 = 10 with non-negativity conditions. Using the simplex method, the optimal solution is found to be h1 = 36.25, x1 = h2 = 0, x2 = 1.25, z = 10. The second problem minimizes z = x1 - 2x2 subject to the constraints 9x1 + 5x2 ≤ 15 and 5x1 + x2 ≤ 4 with non-negativity conditions

    Copyright:

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

    Ayudantia 3

    Uploaded by

    cperez
    The document provides steps to solve two linear programming optimization problems. The first problem maximizes z = 3x1 + 8x2 subject to the constraints 2x1 + 3x2 + h1 = 40 and 4x1 + 8x2 + h2 = 10 with non-negativity conditions. Using the simplex method, the optimal solution is found to be h1 = 36.25, x1 = h2 = 0, x2 = 1.25, z = 10. The second problem minimizes z = x1 - 2x2 subject to the constraints 9x1 + 5x2 ≤ 15 and 5x1 + x2 ≤ 4 with non-negativity conditions

    Copyright:

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

    Estandarizar Max z = 3x1 + 8x2 + 0h1 + 0h2

    s.a
    2x1 + 3x2 + h1 = 40
    4x1 + 8x2 + h2 = 10
    x1,x2,h1,h2 >= 0

    Forma lenta:
    vb x1 x2 h1 h2 ld cuociente:
    h1 2 3 1 0 40 13.33333
    h2 4 8 0 1 10 1.25
    "-z 3 8 0 0 0
    Entra x2 y sale h2
    vb x1 x2 h1 h2 ld
    h1 2 3 1 0 40
    x2 4 8 0 1 10 F2/8
    "-z 3 8 0 0 0

    vb x1 x2 h1 h2 ld
    h1 2 3 1 0 40 F1 - 3 * F2
    x2 0.5 1 0 0.125 1.25
    "-z 3 8 0 0 0 F3 - 8 * F2

    vb x1 x2 h1 h2 ld
    h1 0.5 0 1 -0.375 36.25
    x2 0.5 1 0 0.125 1.25
    "-z -1 0 0 -1 -10

    Solucion optima:
    vb: h1 = 36,25 no basicas: x1 = h2 = 0
    x2 = 1,25
    z = 10
    Forma rapida:
    vb x1 x2 h1 h2 ld cuociente:
    h1 2 3 1 0 40 13.33333 2° F1 - 3 * F2
    h2 4 8 0 1 10 1.25 1° F2/8
    "-z 3 8 0 0 0 2° F3 - 8 * F2
    Entra x2 y sale h2
    vb x1 x2 h1 h2 ld
    h1 0.5 0 1 -0.375 36.25
    x2 0.5 1 0 0.125 1.25
    "-z -1 0 0 -1 -10

    Solucion optima:
    vb: h1 = 36,25 no basicas: x1 = h2 = 0
    x2 = 1,25
    z = 10
    Min z = x1 - 2x2
    sa
    9x1 + 5x2 <= 15
    5x1 + x2 <= 4
    x1,x2 >= 0

    Estandarizar:
    Min z = x1 - 2x2 + 0h1 + 0h2 vb x1 x2 h1
    s.a h1 9 5 1
    9x1 + 5x2 + h1 = 15 h2 5 1 0
    5x1 + x2 + h2 = 4 "-z 1 -2 0
    x1,x2,h1,h2 >=0 entra x1 y sale h1
    vb x1 x2 h1
    x1 1.8 1 0.2
    h2 3.2 0 -0.2
    "-z 4.6 0 0.4

    solucion optima:
    vb: x1 = 3 no basicas:
    h2 = 1
    z = -6
    h2 ld
    0 15 3
    1 4 4
    0 0

    h2 ld
    0 3
    1 1
    0 6

    x1 = h1 = 0

    You might also like