Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Ejercicio Que Falta

    Uploaded by

    Samuel Castro
    The document presents a linear programming problem with the objective function Max Z= 1x1 + 2x2 + 16x3 - MR1 - MR2 and constraints 4x1+x2+x3+s1=20, x1+8x2+s2=40, x2+8x3-s3+R1=40, 2x1+2x2+8x3-s4+R2=16. It provides the coefficients and solves the problem iteratively, showing the values of the variables at each iteration.

    Copyright:

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

    You might also like

    Ejercicio Que Falta

    Uploaded by

    Samuel Castro
    7 views3 pages
    The document presents a linear programming problem with the objective function Max Z= 1x1 + 2x2 + 16x3 - MR1 - MR2 and constraints 4x1+x2+x3+s1=20, x1+8x2+s2=40, x2+8x3-s3+R1=40, 2x1+2x2+8x3-s4+R2=16. It provides the coefficients and solves the problem iteratively, showing the values of the variables at each iteration.

    Original Description:

    Original Title

    ejercicio que falta.xlsx

    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 presents a linear programming problem with the objective function Max Z= 1x1 + 2x2 + 16x3 - MR1 - MR2 and constraints 4x1+x2+x3+s1=20, x1+8x2+s2=40, x2+8x3-s3+R1=40, 2x1+2x2+8x3-s4+R2=16. It provides the coefficients and solves the problem iteratively, showing the values of the variables at each iteration.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    7 views3 pages

    Ejercicio Que Falta

    Uploaded by

    Samuel Castro
    The document presents a linear programming problem with the objective function Max Z= 1x1 + 2x2 + 16x3 - MR1 - MR2 and constraints 4x1+x2+x3+s1=20, x1+8x2+s2=40, x2+8x3-s3+R1=40, 2x1+2x2+8x3-s4+R2=16. It provides the coefficients and solves the problem iteratively, showing the values of the variables at each iteration.

    Copyright:

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

    Max Z= 1𝑥1 + 2𝑥1 + 16𝑥3 - MR1 - MR2

    4x1+x2+x3+s1=20
    x1+8x2+s2=40
    x2+8x3-s3+R1=40
    2x1+2x2+8x3-s4+R2=16

    x1,x2,x3,s1,s2,s3,s4,R1,R2 >= 0
    x1 x2 x3 s1 s2 s3 s4
    z -1 -2 -16 0 0 0 0
    s1 4 1 1 1 0 0 0
    s2 1 8 0 0 1 0 0
    R1 0 1 8 0 0 -1 0
    R2 2 2 8 0 0 0 -1

    x1 x2 x3 s1 s2 s3 s4
    z -1 -1002 -8016 0 0 1000 0
    s1 4 1 1 1 0 0 0
    s2 1 8 0 0 1 0 0
    R1 0 1 8 0 0 -1 0
    R2 2 2 8 0 0 0 -1

    x1 x2 x3 s1 s2 s3 s4
    z -2001 -3002 -16016 0 0 1000 1000
    s1 4 1 1 1 0 0 0
    s2 1 8 0 0 1 0 0
    R1 0 1 8 0 0 -1 0
    R2 2 2 8 0 0 0 -1

    x1 x2 x3 s1 s2 s3 s4
    z 2003 1002 0 0 0 1000 -1002
    s1 -3.75 -0.75 0 -1 0 0 -0.125
    s2 1 8 0 0 1 0 0
    R1 -2 -1 0 0 0 -1 1
    x3 0.25 0.25 1 0 0 0 -0.125

    x1 x2 x3 s1 s2 s3 s4
    z -1 0 0 0 0 -2 0
    s1 -4 -0.875 0 -1 0 -0.125 0
    s2 1 8 0 0 1 0 0
    s4 -2 -1 0 0 0 -1 1
    x3 0 0.125 1 0 0 -0.125 0

    x1 x2 x3 s1 s2 s3 s4
    z 63 14 0 16 0 0 0
    s1 32 7 0 8 0 1 0
    s2 1 8 0 0 1 0 0
    s4 30 6 0 8 0 0 1
    x3 4 1 1 1 0 0 0
    R1 R2 Sol
    1000 1000 0
    0 0 20
    0 0 40
    1 0 40
    0 1 16

    R1 R2 Sol
    0 1000 -40000
    0 0 20
    0 0 40
    1 0 40
    0 1 16

    R1 R2 Sol
    0 0 -56000 coc
    0 0 20 20
    0 0 40 #DIV/0!
    1 0 40 5
    0 1 16 2

    R1 R2 Sol
    0 2002 -23968 coc
    0 0.125 -18 144
    0 0 40 #DIV/0!
    1 -1 24 24
    0 0.125 2 -16

    R1 R2 Sol
    1002 1000 80 coc
    0.125 0 -15 120
    0 0 40 #DIV/0!
    1 -1 24 -24
    0.125 0 5 -40

    R1 R2 Sol
    1000 1000 320
    -1 0 120
    0 0 40
    0 -1 144
    0 0 20

    You might also like