Scribd Logo
Upload

Welcome to Scribd!

  • Ejercicio: +s1 - s2-t1 +s3

    Uploaded by

    danycaro7
    19 views5 pages
    This document presents an optimization problem to maximize an objective function subject to constraints. It provides the objective function, constraints, and standardizes the problem by determining shadow prices and slack/surplus variables. The optimal solution is found to be x1=0, x2=6.15384615, x3=0.76923077, x4=0, with an optimal value of 9.230769 for the objective function. However, the final matrix shows negative and zero values for the difference between the right and left sides, indicating the optimal solution does not satisfy the constraints since it is a maximization problem.

    Original Description:

    Original Title

    examen

    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
    This document presents an optimization problem to maximize an objective function subject to constraints. It provides the objective function, constraints, and standardizes the problem by determining shadow prices and slack/surplus variables. The optimal solution is found to be x1=0, x2=6.15384615, x3=0.76923077, x4=0, with an optimal value of 9.230769 for the objective function. However, the final matrix shows negative and zero values for the difference between the right and left sides, indicating the optimal solution does not satisfy the constraints since it is a maximization problem.

    Copyright:

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

    Ejercicio: +s1 - s2-t1 +s3

    Uploaded by

    danycaro7
    This document presents an optimization problem to maximize an objective function subject to constraints. It provides the objective function, constraints, and standardizes the problem by determining shadow prices and slack/surplus variables. The optimal solution is found to be x1=0, x2=6.15384615, x3=0.76923077, x4=0, with an optimal value of 9.230769 for the objective function. However, the final matrix shows negative and zero values for the difference between the right and left sides, indicating the optimal solution does not satisfy the constraints since it is a maximization problem.

    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

    Ejercicio Estandarizar

    F.O
    Z max=2x1+x2+4x3+5x4 Z max=2x1+x2+4x3+5x4+0s1-0s2+0s3-100t1
    S.A
    x1+3x2+2x3+5x4≤20 x1+3x2+2x3+5x4+s1=20
    2x1+16x2+x3+x4≥4 2x1+16x2+x3+x4-s2-t1=4
    3x1+x2+5x3+10x4≤10 3x1+x2+5x3+10x4+s3=10
    x1,x2,x3,x4≥0
    Matriz caracteristica
    CJ 2 1 4 5 0
    Ci VB Bi X1 X2 x3 x4 s1
    0 S1 20 1 3 2 5 1
    -100 t1 4 2 16 1 1 0
    0 s3 10 3 1 5 10 0
    Zj -400 -200 -1600 -100 -100 0
    Cj-Zj --- 202 1601 104 105 0

    CJ 2 1 4 5 0
    Ci VB Bi X1 X2 x3 x4 s1
    0 S1 19.25 0.625 0 1.8125 4.8125 1
    1 x2 0.25 0.125 1 0.0625 0.0625 0
    0 s3 9.75 2.875 0 4.9375 9.9375 0
    Zj 0.25 0.125 1 0.0625 0.0625 0
    Cj-Zj --- 1.875 0 3.9375 4.9375 0

    CJ 2 1 4 5 0
    Ci VB Bi X1 X2 x3 x4 s1
    0 S1 14.5283019 -0.7672956 0 -0.5786 0 1
    1 x2 0.18867925 0.10691824 1 0.0314 0 0
    5 x4 0.98113208 0.28930818 0 0.4969 1 0
    Zj 5.09433962 1.55345912 1 2.51572327 5 0
    Cj-Zj --- 0.44654088 0 1.48427673 0 0

    CJ 2 1 4 5 0
    Ci VB Bi X1 X2 x3 x4 s1
    0 S1 15.67 -0.43 0 0 1.6455 1
    1 x2 0.127 0.0886 1 0 -0.0632 0
    4 x3 1.9746 0.5822 0 1 2.0126 0
    Zj 8.0253 2.4177 1 4 7.9746 0
    Cj-Zj --- -0.4177 0 0 -2.9873 0

    CJ 2 1 4 5 0
    Ci VB Bi X1 X2 x3 x4 s1
    0 s2 95.2307 -2.6153 0 0.0000 7.0769 6.0769
    1 x2 6.1538 -0.0769 1 0.0000 0.3846 0.3846
    4 x3 0.7692 0.6153 0 1.0000 1.923 -0.0769
    Zj 9.2306 2.3843 1 4 8.0766 0.077
    Cj-Zj --- -0.3843 0 0 -3.0766 -0.077
    R/ El final de nuestras matrices pues la fila Cj-Zj nos arroja resultados negativos y ceros ya que la funcion es de m
    0 0 -100
    s2 s3 t1 Oi
    0 1 0 6.666666667
    -1 0 -1 0.25
    0 1 0 10
    100 0 100
    -100 0 -200

    0 0 -100
    s2 s3 t1 Oi Entra x2 sale t1
    0.1875 1 0.1875 4 f2*-3+f1
    -0.0625 0 -0.0625 4 f2/16
    0.0625 1 0.0625 0.981132075 f2*-1+f3
    -0.0625 0 -0.0625
    0.0625 0 -99.9375

    0 0 -100
    s2 s3 t1 Oi Entra x4 sale s3
    0.1572327 0.51572327 0.1572327 -25.1086957 f3*-4,8124+f1
    -0.06210692 0 -0.06210692 6 f3*-0,0625+f2
    0.00628931 0.10062893 0.00628931 1.974683544 f3/9,9375
    -0.03066038 0.50314465 -0.03066038
    0.03066038 -0.50314465 -99.9693396

    0 0 -100
    s2 s3 t1 Oi
    0.1645 -0.3670 1.6455 95.2307 Entra x3 sale x4
    -0.063 -0.0126 -0.061 -2 f3*0,5786+f1
    0.0126 0.2025 0.013 156 f3*-0,0314+f2
    -0.0126 0.7974 -0.0126 f3/0,4969
    0.0126 -0.7974 -99.9874

    0 0 -100
    s2 s3 t1 Oi Entra s2 sale s1
    1 -2.2307 1 f1/0,1645
    0 -0.1538 0 f1*0,063+f2
    0 0.2307 0 f1*-0,0126+f3
    0 0.7692 0
    0 -0.7692 -100
    ceros ya que la funcion es de maximización.
    Ejercicio
    Variables x1 x2 x3 x4
    F.O Valores 0 6.15384615 0.76923077 0
    Z max=2x1+x2+4x3+5x4 FO 2 1 4 5
    S.A R1 1 3 2 5
    x1+3x2+2x3+5x4≤20 R2 2 16 1 1
    2x1+16x2+x3+x4≥4 R3 3 1 5 10
    3x1+x2+5x3+10x4≤10
    x1,x2,x3,x4≥0
    9.23076923077
    20 <= 20 S1 1
    99.2307692308 ≥= 4 S2 0.04031008
    10 <= 10 S3 1

    You might also like