Scribd Logo
Upload

Welcome to Scribd!

  • Opera Ciones 1

    Uploaded by

    Eliel Edson Sienfuegos Alejandro
    12 views5 pages
    The document contains information about several linear programming problems involving maximizing or minimizing objective functions subject to various inequality constraints on decision variables x1, x2, x3. The problems are solved using the simplex method, forming tableau to arrive at optimal solutions that satisfy the constraints and objective functions.

    Original Description:

    Original Title

    opera ciones 1

    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 contains information about several linear programming problems involving maximizing or minimizing objective functions subject to various inequality constraints on decision variables x1, x2, x3. The problems are solved using the simplex method, forming tableau to arrive at optimal solutions that satisfy the constraints and objective functions.

    Copyright:

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

    Opera Ciones 1

    Uploaded by

    Eliel Edson Sienfuegos Alejandro
    The document contains information about several linear programming problems involving maximizing or minimizing objective functions subject to various inequality constraints on decision variables x1, x2, x3. The problems are solved using the simplex method, forming tableau to arrive at optimal solutions that satisfy the constraints and objective functions.

    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 5

    Max Z=-x1+3x2-3x3

    s.a 3x1-1x2+2x3 +S1=7


    3x1-1x2+2x3<=7 .-2x1+4x2+ S2=10
    .-2x1+4x2<=10 .-4x1+3x2+8x3+ S3=12
    .-4x1+3x2+8x3<=12

    tabla I
    Cj -1 3 -3 0
    Xj bn x1 x2 x3 S1
    0 S1 7 3 -1 2 1
    0 S2 10 -2 4 0 0
    0 S3 12 -4 3 8 0
    Zj 0 0 0 0 0
    Zj-Cj -1 -3 3 0
    entra

    tabla II
    Cj 2 5 8 0
    Xj bn x1 x2 x3 S1
    0 S1 16 2 6 0 1
    8 x3 20 1 .1/2 1 0
    0 S3 20 3 2 0 0
    Zj 160 8 4 8 0
    Zj-Cj 6 -1 0 0
    entra

    tabla III
    Cj 2 5 8 0
    Xj bn x1 x2 x3 S1
    5 x2 .8/3 .1/3 1 0 .1/6
    8 x3 .56/3 .5/6 0 1 .-1/12
    0 S3 .44/3 .7/3 0 0 .-1/3
    Zj .488/3 .25/3 5 8 .1/6
    Zj-Cj .19/3 0 0 .1/6
    tabla I
    0 0 Cj 2 5
    S2 S3 Xj bn x1 x2
    0 0 0 S1 96 6 8
    1 0 sale 0 S2 20 1 0.5
    0 1 0 S3 60 5 3
    0 0 Zj 0 0 0
    0 0 Zj-Cj -2 -5

    0 0
    S2 S3
    -2 0 sale S1-4(x3)
    .1/2 0
    -1 1 S3-2(x3)
    4 0
    4 0

    0 0
    S2 S3 x3-0.5(S1)
    .-1/3 0
    .2/3 0
    .-1/3 1 S3-2(S1)
    .11/3 0
    .11/3 0
    8 0 0 0
    x3 S1 S2 S3
    4 1 0 0
    1 0 0.5 0
    2 0 0 1
    0 0 0 0
    -8 0 0 0
    Max Z=2x1+4x2+3x3

    sa 3x1+4x2+3x3<=60
    2x1+1x2+2x3<=40 3x1+4x2+3x3+S1 =60
    1x1+3x2+2x3<=80 2x1+1x2+2x3+ S2 =40
    1x1+3x2+2x3+ S3=80
    x1,x2,x3>=0

    tabla I
    Cj 2 4 3
    Xj bn x1 x2 x3
    0 S1 60 3 4 3
    0 S2 40 2 1 2
    0 S3 80 1 3 2
    Zj 0 0 0 0
    Zj-Cj -2 -4 -3
    entra

    tabla II
    Cj 2 4 3
    Xj bn x1 x2 x3
    4 x2 15 .3/4 1 .3/4
    0 S2 25 .5/4 0 .5/4
    0 S3 35 .-5/4 0 .-1/4
    Zj 60 3 4 3
    Zj-Cj 1 0 0
    0 0 0
    S1 S2 S3
    1 0 0 sale
    0 1 0
    0 0 1
    0 0 0
    0 0 0

    0 0 0
    S1 S2 S3
    .1/4 0 0
    .-1/4 1 0 S2-1(x2)
    .-3/4 0 1 S3-3(x1)
    4 0 0
    4 0 0

    You might also like