Scribd Logo
Upload

Welcome to Scribd!

  • 12 views

    Si PDF

    Uploaded by

    Stevan Riaño
    This document summarizes the simplex method to solve a linear programming problem with the objective of maximizing the function z = 3X1 + 2X2, subject to the constraints X1 < 12, X1 + 3X2 < 45, and 2X1 + X2 < 30, with non-negativity constraints X1 > 0 and X2 > 0. It shows the initial simplex tableau and three subsequent simplex tableaus, arriving at the optimal solution of X1 = 9, X2 = 3, and z = 51.

    Copyright:

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

    Si PDF

    Uploaded by

    Stevan Riaño
    12 views1 page
    This document summarizes the simplex method to solve a linear programming problem with the objective of maximizing the function z = 3X1 + 2X2, subject to the constraints X1 < 12, X1 + 3X2 < 45, and 2X1 + X2 < 30, with non-negativity constraints X1 > 0 and X2 > 0. It shows the initial simplex tableau and three subsequent simplex tableaus, arriving at the optimal solution of X1 = 9, X2 = 3, and z = 51.

    Original Title

    si (1).pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document summarizes the simplex method to solve a linear programming problem with the objective of maximizing the function z = 3X1 + 2X2, subject to the constraints X1 < 12, X1 + 3X2 < 45, and 2X1 + X2 < 30, with non-negativity constraints X1 > 0 and X2 > 0. It shows the initial simplex tableau and three subsequent simplex tableaus, arriving at the optimal solution of X1 = 9, X2 = 3, and z = 51.

    Copyright:

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

    Si PDF

    Uploaded by

    Stevan Riaño
    This document summarizes the simplex method to solve a linear programming problem with the objective of maximizing the function z = 3X1 + 2X2, subject to the constraints X1 < 12, X1 + 3X2 < 45, and 2X1 + X2 < 30, with non-negativity constraints X1 > 0 and X2 > 0. It shows the initial simplex tableau and three subsequent simplex tableaus, arriving at the optimal solution of X1 = 9, X2 = 3, and z = 51.

    Copyright:

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

    MAXIMIZACION METODO SIMPLEX

    z (MAX) = 3X1 + 2X2


    SUJETA A
    X1 < 12 1
    X1 + 3X2 < 45 2
    2X1 + X2 < 30 3
    X1 > 0 4
    X2 > 0 5

    ESTANDARIZACION
    TABLA SIMPLEX INICIAL
    z (MAX) = 3X1 + 2X2 Z X1 X2 S1 S2 S3 SOLUCION
    Z - 3X1 - 2X2 1 -3 -2 0 0 0 0
    X1 + S1 = 12 1 0 1 0 1 0 0 12
    X1 + 3X2 + S2 = 45 2 0 1 3 0 1 0 45
    2X1 + X2 + S3 = 30 3 0 2 1 0 0 1 30

    TABLA SIMPLEX 2
    Z X1 X2 S1 S2 S3 SOLUCION
    1 0 -2 3 0 0 36
    0 1 0 1 0 0 12
    0 0 3 -1 1 0 33
    0 0 1 -2 0 1 6
    TABLA SIMPLEX 3
    Z X1 X2 S1 S2 S3 SOLUCION
    1 0 0 -1 0 2 48
    0 1 0 1 0 0 12
    0 0 0 5 1 -3 15
    0 0 1 -2 0 1 6

    TABLA SIMPLEX 4
    Z X1 X2 S1 S2 S3 SOLUCION
    1 0 0 0 1/5 7/5 51
    0 1 0 0 -1/5 3/5 9
    0 0 0 1 1/5 -3/5 3
    0 0 1 0 2/5 -1/5 12

    You might also like