Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 42 views

    Maximizacion Practica

    Uploaded by

    Jose Ic
    This linear programming problem seeks to maximize the objective function z=4x1+3x2 subject to four constraints: 2x1+3x2 ≤6, -3x1+2x2 ≤3, 2x2 ≤5, and 2x1+x2 ≤4, with non-negative variables x1, x2. The optimal solution is x1=1.5, x2=1, with the maximum value of z being 9.

    Copyright:

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

    Maximizacion Practica

    Uploaded by

    Jose Ic
    42 views2 pages
    This linear programming problem seeks to maximize the objective function z=4x1+3x2 subject to four constraints: 2x1+3x2 ≤6, -3x1+2x2 ≤3, 2x2 ≤5, and 2x1+x2 ≤4, with non-negative variables x1, x2. The optimal solution is x1=1.5, x2=1, with the maximum value of z being 9.

    Original Title

    MAXIMIZACION PRACTICA

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This linear programming problem seeks to maximize the objective function z=4x1+3x2 subject to four constraints: 2x1+3x2 ≤6, -3x1+2x2 ≤3, 2x2 ≤5, and 2x1+x2 ≤4, with non-negative variables x1, x2. The optimal solution is x1=1.5, x2=1, with the maximum value of z being 9.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Download as xlsx, pdf, or txt
    42 views2 pages

    Maximizacion Practica

    Uploaded by

    Jose Ic
    This linear programming problem seeks to maximize the objective function z=4x1+3x2 subject to four constraints: 2x1+3x2 ≤6, -3x1+2x2 ≤3, 2x2 ≤5, and 2x1+x2 ≤4, with non-negative variables x1, x2. The optimal solution is x1=1.5, x2=1, with the maximum value of z being 9.

    Copyright:

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

    Maximizar z=4x1+3x2 Z X1 X2 S1 S2 S3 S4

    sujeto a: Z 1 -4 -3 0 0 0 0
    2x1+3x2 ≤6 S1 0 2 3 1 0 0 0
    -3x1+2x2 ≤3
    2x2 ≤5 S2 0 -3 2 0 1 0 0
    2x1+x2 ≤4 S3 0 0 2 0 0 1 0
    x1,x2 ≥0 S4 0 2 1 0 0 0 1

    Maximizar Z- 4X1-
    3X2=0 Z X1 X2 S1 S2 S3 S4
    sujeto a:
    2X1+3X2 +S1 =6 Z 1 0 -1 0 0 0 2
    -3X1+2X2+ S2 =3 S1 0 0 2 1 0 0 -1
    2X2 + S3 =5 S2 0 0 3.5 0 1 0 1.5
    2X1+X2 + S4
    =4 S3 0 0 2 0 0 1 0
    x1,x2,S1,S2,S3,S4≥0 X1 0 1 0.5 0 0 0 0.5

    Z X1 X2 S1 S2 S3 S4
    Z 1 0 0 0.5 0 0 1.5
    X2 0 0 1 0.5 0 0 -0.5
    S2 0 0 0 -1.75 1 0 3.25
    S3 0 0 0 -1 0 1 1
    X1 0 1 0 -0.25 0 0 0.75

    Z X1 X2 S1 S2 S3 S4
    Z 1 -4 -3 0 0 0 0
    S1 0 2 3 1 0 0 0
    S2 0 -3 2 0 1 0 0
    S3 0 0 2 0 0 1 0
    S4 0 2 1 0 0 0 1
    R
    0 3
    6 -1
    3 0
    5 2
    4

    R 1
    8 0.38889
    2 0.4
    9 0.25
    5
    2

    R Z=9 9
    9 X1=1.5 1.5
    1 X2=1 1
    5.5 S1=0 0
    3 S2=5.5 5.5
    1.5 S3=3 3
    S4=0 0

    R
    0 0
    6 6
    3 3
    5 5
    4 4

    You might also like