Scribd Logo
Upload

Welcome to Scribd!

  • 19 views

    Ejercicio

    Uploaded by

    nicolas andres figueroa camargo
    This document presents a linear programming optimization problem to maximize total cost (Z) by determining the optimal quantities of three types of yachts (X1, X2, X3) given production constraints. The objective is to maximize Z=33,000X1 + 35,000X2 + 37,000X3. The constraints are that 16X1 + 14X2 + 12X3 must be greater than or equal to 600, 2X1 + 3X2 + 5X3 must be greater than or equal to 150, and 2X1 + 3X2 + 3X3 must be greater than or equal to 150. The optimal solution is found to be 0 for X1 and X2,

    Copyright:

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

    Ejercicio

    Uploaded by

    nicolas andres figueroa camargo
    19 views5 pages
    This document presents a linear programming optimization problem to maximize total cost (Z) by determining the optimal quantities of three types of yachts (X1, X2, X3) given production constraints. The objective is to maximize Z=33,000X1 + 35,000X2 + 37,000X3. The constraints are that 16X1 + 14X2 + 12X3 must be greater than or equal to 600, 2X1 + 3X2 + 5X3 must be greater than or equal to 150, and 2X1 + 3X2 + 3X3 must be greater than or equal to 150. The optimal solution is found to be 0 for X1 and X2,

    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 document presents a linear programming optimization problem to maximize total cost (Z) by determining the optimal quantities of three types of yachts (X1, X2, X3) given production constraints. The objective is to maximize Z=33,000X1 + 35,000X2 + 37,000X3. The constraints are that 16X1 + 14X2 + 12X3 must be greater than or equal to 600, 2X1 + 3X2 + 5X3 must be greater than or equal to 150, and 2X1 + 3X2 + 3X3 must be greater than or equal to 150. The optimal solution is found to be 0 for X1 and X2,

    Copyright:

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

    Ejercicio

    Uploaded by

    nicolas andres figueroa camargo
    This document presents a linear programming optimization problem to maximize total cost (Z) by determining the optimal quantities of three types of yachts (X1, X2, X3) given production constraints. The objective is to maximize Z=33,000X1 + 35,000X2 + 37,000X3. The constraints are that 16X1 + 14X2 + 12X3 must be greater than or equal to 600, 2X1 + 3X2 + 5X3 must be greater than or equal to 150, and 2X1 + 3X2 + 3X3 must be greater than or equal to 150. The optimal solution is found to be 0 for X1 and X2,

    Copyright:

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

    Variables:

    X1 Yate Tipo 1
    X2 Yate Tipo 2
    X3 Yate Tipo 3
    Z costo

    Funcion Objetivo
    Max Z= 33000 X1 + 35000 X2 + 37000 X3

    Restrcicciones
    16 X1 + 14 X2 + 12 X3 >= 600
    2 X1 + 3 X2 + 5 X3 >= 150
    2 X1 + 3 X2 + 3 X3 >= 150
    X1 X2 X3 >= 0

    funcion objetivo max Z 1850000

    X1 X2 X3
    0 0 50
    33000 35000 37000
    Reestricciones
    lado Izq Lado Der
    16 14 12 600 >= 600
    2 3 5 250 >= 150
    2 3 3 150 >= 150
    Ejercicio Simplex primal
    Enter the values in the shaded area then use the Run Excel's
    Solver button. Alternatively, or to view the sensitivity results, open
    Solver by going to the Data Tab (Excel 2007, 2010, 2013, 2016) or
    Linear Programming the Tools menu (Excel 2003, 2011).

    Use one of the three signs below for each constraint


    < less than or equal to
    = equals (You need to enter an apostrophe first.)
    > greater than or equal to

    Data Results
    x1 x2 x3 LHS Slack/Surplus
    Maximize 33000 35000 37000 sign RHS 1850000
    Constraint 1 16 14 12 > 600 600 0 Constrain
    Constraint 2 2 3 5> 150 250 -100 Constrain
    Constraint 3 2 3 3> 150 150 0 Constrain

    Results
    Variables 0 0 50
    Objective 1850000

    Page 2
    Variables:
    X1 Yate Tipo 1
    X2 Yate Tipo 2
    X3 Yate Tipo 3
    Z costo

    Funcion Objetivo
    Max Z= 33000 X1 + 35000 X2 + 37000 X3

    Restrcicciones
    16 X1 + 14 X2 + 12 X3 >= 600
    2 X1 + 3 X2 + 5 X3 >= 150
    2 X1 + 3 X2 + 3 X3 >= 150
    X1 X2 X3 >= 0

    Modelo Aumentado
    16 X1 + 14 X2 + 12 X3 + h1
    2 X1 + 3 X2 + 5 X3 + h2
    2 X1 + 3 X2 + 3 X3 + h3

    Definicion de variables basicas (Grados de Libertad)


    n= numero de variables m= numero de ecuaciones
    GL= n - m = 6- 3= 3

    variables basicas = 3
    variables no basicas = 3

    igualar "Z" a cero


    Z= 33000 X1 + 35000 X2 + 37000 X3
    Z -33000 x1 - -35000 X2 - -37000 X3 = 0

    IT 1
    VB Z X1 X2 X3 h1 h2 h3 Sol r
    z 1 -33000 -35000 -37000 0 0 0 0
    h1 0 16 14 12 1 0 0 600 50
    h2 0 2 3 5 0 1 0 150 30
    h3 0 2 3 3 0 0 1 150 50

    IT 1
    VB Z X1 X2 X3 h1 h2 h3 Sol r
    Z 1 -18200 -12800 0 0 9 0 1350 -0.07417582
    h1 0 11.2 6.8 0 1 -2.4 0 240 21.4285714
    x3 0 0.4 0.6 1 0 0.2 0 30 75
    h3 0 0.8 1.2 0 0 -0.6 1 60 75

    IT 2
    VB Z X1 X2 X3 h1 h2 h3 Sol r
    Z 1 0 -1750 0 1625 -3891 0 391350 -223.628571
    x1 0 1 0.60714286 0 0.089286 -0.214 0 21.428571429 35.2941176
    x3 0 0 0.35714286 1 -0.03571 0.2857 0 21.428571429 60
    x1 0 -0.16 0.72 0 0 -0.32 0 -450 5625
    >= 600
    >= 150
    >= 150

    GL= Grdos de libertad

    You might also like