Scribd Logo
Upload

Welcome to Scribd!

  • Tarea 4

    Uploaded by

    Silvestre
    22 views6 pages
    The document presents an optimization problem to maximize profits from producing and selling furniture. The objective is to maximize total profits (Z) from producing tables, chairs, beds and bookshelves. There are constraints on the production quantities based on available resources. The problem is modeled using linear programming with variables defined for the quantities of each item and constraints defined by inequalities between the variables. The problem is then solved iteratively by adjusting the variables to satisfy the constraints and maximize the objective function.

    Original Description:

    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 presents an optimization problem to maximize profits from producing and selling furniture. The objective is to maximize total profits (Z) from producing tables, chairs, beds and bookshelves. There are constraints on the production quantities based on available resources. The problem is modeled using linear programming with variables defined for the quantities of each item and constraints defined by inequalities between the variables. The problem is then solved iteratively by adjusting the variables to satisfy the constraints and maximize the objective function.

    Copyright:

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

    Tarea 4

    Uploaded by

    Silvestre
    The document presents an optimization problem to maximize profits from producing and selling furniture. The objective is to maximize total profits (Z) from producing tables, chairs, beds and bookshelves. There are constraints on the production quantities based on available resources. The problem is modeled using linear programming with variables defined for the quantities of each item and constraints defined by inequalities between the variables. The problem is then solved iteratively by adjusting the variables to satisfy the constraints and maximize the objective function.

    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 6

    COSTO PRECIO DE

    RECTANGULARCUADRADA TRAPEZOIDE
    RETANGULARUNITARIO VENTA
    MESAS 2 2 0 0 $ 10,000 $ 30,000
    SILLAS 1 2 0 0 $ 8,000 $ 28,000
    CAMAS 1 1 2 0 $ 20,000 $ 40,000
    BIBLIOTECAS 2 0 2 4 $ 40,000 $ 60,000

    FUNCIÓN OBJETIVO
    Funcion objetivo: Maximizar
    Z= 20,000 M + 20,000 S + 20,000 C + 20,000 B

    X1 = CANTIDAD DE MESAS A PRODUCIR


    X2 = CANTIDAD DE SILLAS A PRODUCIR
    X3 = CANTIDAD DE CAMAS A PRODUCIR
    X4 = CANTIDAD DE BIBLIOTECAS A PRODUCIR

    RESTRICCIONES

    1.- 2 X1 + 1 X2 + 1 X3 + 2 X4 ≤ 24
    2.- 2 X1 + 2 X2 + 1 X3 ≤ 20
    3.- 2 X3 + 2 X4 ≤ 20
    4.- 4 X4 ≤ 16

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 -20000 -20000 -20000 -20000 0 0 0
    S1 0 2 1 1 2 1 0 0
    S2 0 2 2 1 0 0 1 0
    S3 0 0 0 2 2 0 0 1
    S4 0 0 0 0 4 0 0 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 -20000 -20000 -20000 -20000 0 0 0
    S1 0 2 1 1 2 1 0 0
    S2 0 1 1 0.50 0 0 0.5 0
    S3 0 0 0 2 2 0 0 1
    S4 0 0 0 0 4 0 0 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 -10000 -20000 0 10000 0
    S1 0 0 -1 0 2 1 -1 0
    X1 0 1 1 0.50 0 0 0.50 0
    S3 0 0 0 2 2 0 0 1
    S4 0 0 0 0 4 0 0 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 -10000 -20000 0 10000 0
    S1 0 0 -1 0 2 1 -1 0
    X1 0 1 1 0.50 0 0 0.50 0
    S3 0 0 0 2 2 0 0 1
    S4 0 0 0 0 4 0 0 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 -10000 -20000 0 10000 0
    X4 0 0 -1 0 1 0.50 -1 0
    X1 0 1 1 0.50 0 0 0.50 0
    S3 0 0 0 2 2 0 0 1
    S4 0 0 0 0 4 0 0 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 -10000 -10000 0 10000 0 0
    X4 0 0 -1 0 1 0.50 -1 0
    X1 0 1 1 0.50 0 0 0.50 0
    S3 0 0 1 2 0 -1 1 1
    S4 0 0 2 0 0 -2 2 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 -10000 -10000 0 10000 0 0
    X4 0 0 -0.5 0 1 0.50 -1 0
    X1 0 1 -1.0 1.00 0 0 0.50 0
    S3 0 0 1.0 2 0 -1 1 1
    S4 0 0 2.0 0 0 -2 2 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 -10000 0 0 10000 0
    X4 0 0 0.0 0 0 -1 10001 0
    X1 0 1 0 1.00 0 0 0.50 0
    S3 0 0 0 2 0 -1 1 1
    X2 0 0 1 0 0 -1 1 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 -10000 0 0 10000 0
    X4 0 0 0 0 1 0.50 10001 0
    X1 0 1 0 1.00 0 0 0.50 0
    X3 0 0 0 2 0 -1 1 1
    X2 0 0 1 0 0 -1 1 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 0 0 0 15000 5000
    X4 0 0 0 10000 1 1 10001 0
    X1 0 1 0 0.00 0 1 0 -1
    X3 0 0 0 1 0 -1 1 1
    X2 0 0 1 0 0 -1 1 0

    Z X1 X2 X3 X4 S1 S2 S3
    Z 1 0 0 0 0 0 15000 5000
    X4 0 0 0 10000 1 0.50 10001 0
    X1 0 1 0 0.00 0 1 0 -1
    X3 0 0 0 1 0 -1 1 1
    X2 0 0 1 0 0 -1 1 0
    20,000 B

    S4 R
    0 0
    0 24 12
    0 20 10
    0 20
    1 16

    S4 R
    0 0
    0 24
    0 10
    0 20
    1 16

    S4 R
    0 200000 20000
    0 4 -2
    0 10
    0 20
    1 16

    S4 R
    0 200000
    0 4 2
    0 10
    0 20 10
    1 16 4

    S4 R
    0 200000
    0 2
    0 10
    0 20
    1 16

    S4 R
    0 240000 20000
    0 2
    0 10
    0 16 -2
    1 8 -4

    S4 R
    0 240000
    0 2
    0 10
    0 16
    1 8

    S4 R
    5000 280000 10000
    5000 4 0.5
    0 14 1
    0 12 -1
    0.50 4

    S4 R
    5000 280000
    5000 4
    0 9
    0 12
    0.50 4

    S4 R
    7500 340000 10000
    5000 4 10000
    1 3 -1
    0.25 6
    0.38 4

    S4 R
    7500 340000
    5000 4
    1 3
    0.25 6
    0.38 4

    You might also like