Scribd Logo
Upload

Welcome to Scribd!

  • 5 views

    Solución: Metodo Simplex de La M Grande

    Uploaded by

    Mario Vidal
    The document presents the simplex method applied to a linear programming problem with 5 variables (X1-X5), 4 constraints (S1-S4), and the objective to maximize Z. The method proceeds through 2 iterations, first setting X5 to its maximum value of 250000, then finding the optimal solution is X5=250000, S1=175000, S2=100000, S3=-250000, S4=0, with the maximum objective value of Z=2950000.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Solución: Metodo Simplex de La M Grande

    Uploaded by

    Mario Vidal
    5 views1 page
    The document presents the simplex method applied to a linear programming problem with 5 variables (X1-X5), 4 constraints (S1-S4), and the objective to maximize Z. The method proceeds through 2 iterations, first setting X5 to its maximum value of 250000, then finding the optimal solution is X5=250000, S1=175000, S2=100000, S3=-250000, S4=0, with the maximum objective value of Z=2950000.

    Original Description:

    asds

    Original Title

    Hamilton

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document presents the simplex method applied to a linear programming problem with 5 variables (X1-X5), 4 constraints (S1-S4), and the objective to maximize Z. The method proceeds through 2 iterations, first setting X5 to its maximum value of 250000, then finding the optimal solution is X5=250000, S1=175000, S2=100000, S3=-250000, S4=0, with the maximum objective value of Z=2950000.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    5 views1 page

    Solución: Metodo Simplex de La M Grande

    Uploaded by

    Mario Vidal
    The document presents the simplex method applied to a linear programming problem with 5 variables (X1-X5), 4 constraints (S1-S4), and the objective to maximize Z. The method proceeds through 2 iterations, first setting X5 to its maximum value of 250000, then finding the optimal solution is X5=250000, S1=175000, S2=100000, S3=-250000, S4=0, with the maximum objective value of Z=2950000.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    METODO SIMPLEX DE LA M GRANDE

    Max Z = 5.3 6.8 4.9 8.4 11.8 0 0 0 0


    Coef Base X1 X2 X3 X4 X5 S1 S2 S3 S4 R.H.S Theta
    0 S1 1 0 0 0 0 1 0 0 0 175000 -
    0 S2 0 1 1 1 0 0 1 0 0 100000 -
    0 S3 -0.5 0 0 0 1 0 0 1 0 0 -
    0 S4 1 1 1 1 1 0 0 0 1 250000 250000
    Z 0 0 0 0 0 0 0 0 0 0
    Ci-Zi 5.3 6.8 4.9 8.4 11.8 0 0 0 0
    0 S1 1 0 0 0 0 1 0 0 0 175000 -
    0 S2 0 1 1 1 0 0 1 0 0 100000 -
    0 S3 -1.5 -1 -1 -1 0 0 0 1 -1 -250000 -
    11.8 X5 1 1 1 1 1 0 0 0 1 250000 250000
    Z 11.8 11.8 11.8 11.8 11.8 0 0 0 11.8 2950000
    Ci-Zi -6.5 -5 -6.9 -3.4 0 0 0 0 -11.8

    Solución
    X1 = 0
    X2 = 0
    X3 = 0
    X4 = 0
    X5 = 250000
    S1 = 175000
    S2 = 100000
    S3 = -250000
    S4 = 0
    Z = 2950000

    You might also like