Scribd Logo
Upload

Welcome to Scribd!

  • Compañía de Fletes Peso Volumen: Programacion Lineal Parte Practica

    Uploaded by

    Kelly Johana Nino Esteves
    7 views9 pages
    The document describes a linear programming problem with two constraints and two variables to maximize the total weight and volume sent from two shipping companies. The objective is to maximize x1 + x2 subject to the constraints that 3x1 + 5x2 ≤ 9200 and 2x1 + x1 ≤ 2400, where x1 and x2 represent the amounts sent from each company. The problem is converted to a standard form with variables x1, x2, s1, s2 and an objective function to maximize z. The optimal solution is found to be x1 = 3.06, x2 = 1.2.

    Original Description:

    simplex

    Original Title

    simplexpl

    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 describes a linear programming problem with two constraints and two variables to maximize the total weight and volume sent from two shipping companies. The objective is to maximize x1 + x2 subject to the constraints that 3x1 + 5x2 ≤ 9200 and 2x1 + x1 ≤ 2400, where x1 and x2 represent the amounts sent from each company. The problem is converted to a standard form with variables x1, x2, s1, s2 and an objective function to maximize z. The optimal solution is found to be x1 = 3.06, x2 = 1.2.

    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 views9 pages

    Compañía de Fletes Peso Volumen: Programacion Lineal Parte Practica

    Uploaded by

    Kelly Johana Nino Esteves
    The document describes a linear programming problem with two constraints and two variables to maximize the total weight and volume sent from two shipping companies. The objective is to maximize x1 + x2 subject to the constraints that 3x1 + 5x2 ≤ 9200 and 2x1 + x1 ≤ 2400, where x1 and x2 represent the amounts sent from each company. The problem is converted to a standard form with variables x1, x2, s1, s2 and an objective function to maximize z. The optimal solution is found to be x1 = 3.06, x2 = 1.2.

    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 9

    PROGRAMACION LINEAL

    PARTE PRACTICA
    1

    COMPAÑÍA DE FLETES PESO VOLUMEN


    compañía A 3L 2
    compañía B 5L 1

    X1 cantidad de cajas a enviar de la compañía x & y


    funcion objetivo : 0,75 x1+ 0,50 x2
    restricciones: 3 x1 + 5x2 <= 9200
    2x1 + x2 <= 2400
    x1 + x2 <= 0

    3 x1 + 5x2 + s1=9200
    2x1 + x2 + s2=2400
    z= 0,75 x1 + 0,50 x2 + 0s1 + 0s2
    z- 0,75 x1 - 0,50 x2 + 0s1 + 0s2 = 0
    ACION LINEAL

    vb x1 x2 s1 s2 z bj
    s1 3 5 1 0 0 9200 3.06
    s2 2 1 0 1 0 2400 1.2
    z -0.75 -0.5 0 0 1 0

    vb x1 x2 s1 s2 z bj
    s1 -1 -4 -1 1 0 -6,800 1,7
    x1 1 0.5 0 0.5 0 1200 2.4
    z 0 -0.875 0 -0.375 -1 -900

    vb x1 x2 s1 s2 z bj
    s1
    x1
    z
    4. Max Z = X1-12X2+4X3
    s.a
    4X1+3X2-X3<=1
    X1+X2-X3<=-2
    -X1+X2+X3>=-1

    X1, X2, X3>=0

    RESTRICCIONES:

    4X1 + 3X2 - X= 4X1 + 3X2 - X3 + S1 = 1


    X1 + X2 - X3 += *-1 -X1 - X2 + X3 - S2 = 2
    -X1 + X2 + X3 = *-1 X1 - X2 - X3 + S3 - T1 = 1

    W = Z - MT1 X1
    W = X1 - 12 X= W - X1 + 12X2 -4X3 +MT1 =0 S1 4
    S3 -1
    W 1
    X2 X3 S1 S2 S3 T1 W BJ
    3 1 1 0 0 0 0 1
    1 1 0 -1 0 0 0 2
    12 4 0 0 0 0 1 0
    5. Max Z = 9000 X1 + 10000X2
    S.A.
    7 X1 + 10 X2 ≤ 700
    10 X1 + 8 X2 ≤ 800
    6 X1 + 15 X2 ≤ 900

    X1, X2 >=0

    ECUACIONES

    7 X1 + 10 X2 + S1 = 700 Z X1 X2
    10 X1 + 8 X2 + S2 = 800 R1 S1 0 7 10
    6 X1 + 15 X2 + S3 = 900 R2 S2 0 10 8
    R3 S3 0 6 15
    Z - 9000 X1 - 10000X2 = 0 R4 Z 1 -9000 -10000

    Z X1 X2
    R1 S1 0 7 10
    R2 S2 0 10 8
    R3 X2 0 2/5 1
    R4 Z 1 -9000 -10000

    Z X1 X2
    R1 S1 0 3 0
    R2 S2 0 6.8 0
    R3 X2 0 2/5 1
    R4 Z 1 -5000 0

    Z X1 X2
    R1 X1 0 1 0
    R2 S2 0 0 0
    R3 X2 0 0 1
    R4 Z 1 0 0

    Z X1 X2
    R1 X1 0 1 0
    R2 S3 0 0 0
    R3 X2 0 0 1
    R4 Z 1 0 0

    Z = 9000 X1 + 10000X2

    809088,458=9000(54,54)+10000(31,78)

    809088,45=490860+317800

    809088=808660
    S1 S2 S3 RESULTADO
    1 0 0 700 70
    0 1 0 800 100
    0 0 1 900 60
    0 0 0 0

    S1 S2 S3 RESULTADO
    1 0 0 700 -10(R3)+R1
    0 1 0 800 -8(R3)+R2
    0 0 1/15 60 R3*1/15
    0 0 0 0 10000(R3)+R4

    S1 S2 S3 RESULTADO
    1 0 - 2/3 100 33.3333333
    0 1 - 8/15 320 47.0588235
    0 0 40/597 60 150
    0 0 666.666667 600000

    S1 S2 S3 RESULTADO
    1/3 0 - 2/9 33.3333333 R1*1/3
    -2.26666667 1 44/45 93.3333333 -6,8(R1)+R2
    - 2/15 0 135/866 46.6666667 -2/5(R1)+R3
    1666.66667 0 -444.444444 766666.667 5000(R1)+R4

    S1 S2 S3 RESULTADO
    -0.18181818 0.22727273 0 54.5411111 2/9(R2)+R1
    -2.31818182 1.02272727 1 95.4542045 R2*45/44
    0.22801771 -0.1594746 0 31.7803811 -135/866(R2)+R3
    636.44808 454.66212 0 809088.458 444,44(R2)+R4
    -150
    95.4545455
    299.358517
    -1725

    You might also like