Scribd Logo
Upload

Welcome to Scribd!

  • Solucion Ejercicio Metodo Simplex

    Uploaded by

    Marcela Marquez
    9 views3 pages
    The document summarizes solving a linear programming problem using the simplex method. It presents the standard form of the problem with constraints and an objective function to maximize. It then shows converting the problem to tabular form and performing two iterations of the simplex method. The conclusion is that the problem has an unbounded solution.

    Original Description:

    Original Title

    SOLUCION EJERCICIO METODO SIMPLEX (1)

    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 summarizes solving a linear programming problem using the simplex method. It presents the standard form of the problem with constraints and an objective function to maximize. It then shows converting the problem to tabular form and performing two iterations of the simplex method. The conclusion is that the problem has an unbounded solution.

    Copyright:

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

    Solucion Ejercicio Metodo Simplex

    Uploaded by

    Marcela Marquez
    The document summarizes solving a linear programming problem using the simplex method. It presents the standard form of the problem with constraints and an objective function to maximize. It then shows converting the problem to tabular form and performing two iterations of the simplex method. The conclusion is that the problem has an unbounded solution.

    Copyright:

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

    UNIVERSIDAD COOPERATIVA DE COLOMBIA

    PROGRAMACION LINEAL
    METODO SIMPLEX

    Resolver el siguiente ejercicio con el Método Simplex

    MAX Z = 20X1 + 12X2 2 - 15 X3 (0)


    s.a: 5X1 - 3X2 ¿ 45 (1)
    X1 + 6X3 ¿ 18 (2)

    3X1 - 6X2 2 + X3 ¿ 60 (3)


    X1, X2, X3 ¿ 0

    Solución:

    Forma estándar: MAX Z - 20X1 - 12X 2 +15X3 =0 (0)


    s.a: 5X 1 - 3X2 + S1 = 45 (1)
    X 1 + 6X3 + S2 = 18 (2)
    3X1 - 6X2 2 + X3 +S3 = 60 (3
    X j ¿ 0, S i ¿ 0

    Forma Tabular:

    VB Z X1 X2 X3 S1 S2 S3 b i
    Entra
    Z 1 -20 -12 15 0 0 0 0

    S1 0 5 -3 0 1 0 0 45 Sale

    S2 0 1 0 6 0 1 0 18

    S3 0 3 -6 1 0 0 1 60

    Z 1 0 -24 15 4 0 0 180
    Entra
    X1 0 1 -3/5 0 1/5 0 0 9
    S2 0 0 3/5 6 -1/5 1 0 9 Sale
    S3 0 0 -21/5 1 -3/5 0 1 33

    Z 1 0 0 255 -4 40 0 540
    0 1 0 6 0 1 0 18
    X 1
    0 0 1 10 -1/3 5/3 0 15
    X 2
    S3 0 0 0 43 -2 7 1 96

    OPERACIONES ITERACION 1:

    NF 0 = FV 0 - CCP [NFP]
    [-20 -12 15 0 0 0 0 ]
    1
    -(-20) [ 1 -3/5 0 5 0 0 9 ]

    [0 -24 15 4 0 0 180 ]

    NF 2 = FV 2 - CCP [NFP]
    [ 1 0 6 0 1 0 18 ]
    1
    -(1) [ 1 -3/5 0 5 0 0 9 ]

    [ 0 3/5 6 -1/5 1 0 9]

    NF3 = FV3 - CCP [NFP]


    [ 3 -6 1 0 0 1 60 ]
    1
    -(3) [ 1 -3/5 0 5 0 0 9 ]

    [ 0 -21/5 1 -3/5 0 1 33

    OPERACIONES ITERACION 2:

    NF 0 = FV 0 - CCP [NFP]
    [0 -24 15 4 0 0 180 ]
    -(-24) [ 0 1 10 -1/3 5/3 0 15 ]

    [0 0 255 -4 40 0 540

    NF1 = FV1 - CCP [NFP] [1 -3/5 0 1/5 0 0 9]


    -(-3/5) [ 0 1 10 -1/3 5/3 0 15]

    [ 1 0 6 0 1 0 18]

    NF3 = FV3 - CCP [NFP] [ 0 -21/5 1 -3/5 0 1 33]


    -(-21/5) [ 0 1 10 -1/3 5/3 0 15]

    [ 0 0 43 -2 7 1 96]

    Conclusión: El problema tiene solución no acotada

    You might also like