Scribd Logo
Upload

Welcome to Scribd!

  • Método Simplex

    Uploaded by

    Tannya Valentina Chacon Baez
    6 views2 pages
    This document describes a linear programming problem with variables X1, X2, S1, S2, S3. The objective is to maximize Cj. In the initial simplex tableau, X2 enters and S1 leaves. In the second iteration, S2 enters. In the final iteration, X1 enters and the problem is solved with an optimal solution of Cj = 3000, X1 = 1, X2 = 0, S1 = 1, S2 = 0, S3 = -1.

    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
    This document describes a linear programming problem with variables X1, X2, S1, S2, S3. The objective is to maximize Cj. In the initial simplex tableau, X2 enters and S1 leaves. In the second iteration, S2 enters. In the final iteration, X1 enters and the problem is solved with an optimal solution of Cj = 3000, X1 = 1, X2 = 0, S1 = 1, S2 = 0, S3 = -1.

    Copyright:

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

    Método Simplex

    Uploaded by

    Tannya Valentina Chacon Baez
    This document describes a linear programming problem with variables X1, X2, S1, S2, S3. The objective is to maximize Cj. In the initial simplex tableau, X2 enters and S1 leaves. In the second iteration, S2 enters. In the final iteration, X1 enters and the problem is solved with an optimal solution of Cj = 3000, X1 = 1, X2 = 0, S1 = 1, S2 = 0, S3 = -1.

    Copyright:

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

    Max Cj 3000 5000 0 0 0

    Cj Var básica X1 X2 S1 S2 S3 Vector recurso


    0 S1 1 2 1 0 0 300
    0 S2 2 1 0 1 0 300
    0 S3 1 1 0 0 1 180
    Zj 0 0 0 0 0 0
    Cj-Zj 3000 5000 0 0 0
    Variable entrada
    Entra X2 y sale S1

    Max Cj 3000 5000 0 0 0


    Cj Var básica X1 X2 S1 S2 S3 Vector recurso
    5000 X2 0.5 1 0.5 0 0 150
    Err:522 S2 1.5 0 -0.5 1 0 150
    0 S3 0.5 0 -0.5 0 1 30
    Zj 2500 5000 2500 0 0 750000
    Cj-Zj 500 0 -2500 0 0
    ENTRA

    Max Cj 3000 5000 0 0 0


    Cj Var básica X1 X2 S1 S2 S3 Vector recurso
    5000 X2 0 1 1 0 -1 120
    Err:522 S2 0 0 1 1 -3 60
    3000 X1 1 0 -1 0 2 60
    Zj 3000 5000 2000 0 1000 780000
    Cj-Zj 0 0 -2000 0 -1000
    Razon mínima
    150 Sale
    300
    180

    Razon mínima
    300
    100
    60 SALE

    Razon mínima

    You might also like