Scribd Logo
Upload

Welcome to Scribd!

  • Tarea Io 1

    Uploaded by

    Fernando Garcia
    9 views3 pages
    The document describes two linear programming problems. The first problem maximizes Z=10X1+6X2+4X3 subject to three constraints. The optimal solution is X1=1, X2=0, X3=5/2 with Z=900. The second problem minimizes Z=3X1-2X2 subject to three constraints. The optimal solution is X1=3, X2=0 with Z=-6.

    Original Description:

    Original Title

    TAREA IO 1.docx

    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 describes two linear programming problems. The first problem maximizes Z=10X1+6X2+4X3 subject to three constraints. The optimal solution is X1=1, X2=0, X3=5/2 with Z=900. The second problem minimizes Z=3X1-2X2 subject to three constraints. The optimal solution is X1=3, X2=0 with Z=-6.

    Copyright:

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

    Tarea Io 1

    Uploaded by

    Fernando Garcia
    The document describes two linear programming problems. The first problem maximizes Z=10X1+6X2+4X3 subject to three constraints. The optimal solution is X1=1, X2=0, X3=5/2 with Z=900. The second problem minimizes Z=3X1-2X2 subject to three constraints. The optimal solution is X1=3, X2=0 with Z=-6.

    Copyright:

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

    1.

    MAX Z =   10 X1 + 6 X2 + 4 X3                                                              


     S.A         X1 +  X2 +   X3    <= 100                       
                  10X1 + 4X2 +   5X3    <= 600                                
                    2X1  + 2X2  +  6 X3   <= 300                           
        
                        X1,X2,X3  >=  0   

    Forma estándar.

    -10X1-6X2-4X3=0

    X1+X2+X3+H1 =100

    10X1+4X2+5X3 +H2 =600

    2X1+2+X2+6X3 +H3=300

    X1, X2, X3, H1, H2, H3≥0

    FORMA TABULAR

    BASE X1 X2 X3 H1 H2 H3 SOLUCIÓN

    Z -10 -6 -4 0 0 0 0

    H1 1 1 1 1 0 0 100 100

    H2 -10 4 5 0 0 0 600 60

    H3 2 2 6 0 1 1 300 150

    BASE X1 X2 X3 H1 H2 H3 SOLUCIÓN

    Z 0 -2 1 0 1 0 600

    H1 0 3/5 ½ 1 -1/10 0 40 0

    H2 1 4/5 ½ 0 1/10 0 60 60

    H3 0 6/5 5 0 -1/5 1 180 0

    -10-(-10*1)=0 1-(1*1)=0 2-(2*1)=0

    -6-(-10*2/5)=-2 1-(1*2/5)=3/5 2-(2*2/5)=6/5

    -4-(-10*1/2)=1 1-(1*1/2)=1/2 6-(2*1/2)=5

    0-(-10*0)=0 1-(1*0)=1 0-(2*0)=0


    BASE X1 X2 X3 H1 H2 H3 SOLUCIÓN

    Z 5 0 7/2 0 3/2 0 900

    H1 -3/2 0 -1/4 1 -1/4 0 -50

    H2 5/2 1 5/4 0 1/4 0 150

    H3 -3 0 7/2 0 -1/2 1 0

    0-(-2*5/2)=5 0-(3/5*5/2)=-3/2 0-(6/5*5/2)=-3


    -2-(-2*1)=0 3/5-(3/5*1)=0 6/5-(6/5*1)=0
    1-(-2*5/4)=7/2 ½-(3/5*5/4)=-1/4 5-(6/5*5/4)=7/2
    0-(-2*0)=0 1-(3/5*0)=1 0-(6/5*0)=0
    1-(-2*1/4)=3/2 -1/10-(3/5*1/4)=-1/4 -1/5-(6/5*1/4)=-1/2
    0-(-2*0)=0 0-(3/5*0)=0 1-(6/5*0)=7
    600-(-2*150)=900 40-(3/5*150)=-50 180-(6/5*150)=0

    2.
    MIN Z  = 3X1 - 2X2
    S.A.      3x1+  X2 <= 3
                 4X1   + 3X2  <= 6
                  X1    +  X2   <= 3 

                 X1,X2,X3 >= 0

    FORMA ESTÁNDAR.

    -3X1+2X2=0

    3X1 + X2+H1 =3

    4X1+3X2 +H2 =6

    X1+ X2 +H3=3

    FORMA TABULAR

    BASE X1 X2 H1 H2 H3 SOLUCIÓ
    N
    Z -3 2 0 0 0 0

    H1 3 1 1 0 0 3 1

    H2 4 3 0 1 0 6 1

    H3 1 1 0 0 1 3 3

    BASE X1 X2 H1 H2 H3 SOLUCIÓN

    Z -9 0 -2 0 0 -6

    H1 3 1 1 0 0 3

    H2 -5 0 -3 1 0 -3

    H3 2 0 -1 0 1 0

    -3-(2*3)=-9 4-(3*3)=-5 1-(1*3)=-2

    2-(2*1)=0 3-(3*1)=0 1-(1*1)=0

    0-(2*1)=-2 0-(3*1)=-3 0-(1*1)=-1

    0-(2*0)=0 1-(3*0)=1 0-(1*0)=0

    0-(2*0)=0 0-(3*0)=0 1-(1*0)=1

    You might also like