Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    Linear Programming Workshop

    Uploaded by

    ScribdTranslations
    The document presents a linear programming problem to minimize the transportation costs of a company that produces in three plants and distributes to three customers. The optimal solution is to send 120 units from Bogotá to Cali, 30 from Bogotá to Pasto, 60 from Tunja to Pasto, and 150 from Cúcuta to Chía, minimizing costs by $3,870.

    Copyright:

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

    Linear Programming Workshop

    Uploaded by

    ScribdTranslations
    8 views5 pages
    The document presents a linear programming problem to minimize the transportation costs of a company that produces in three plants and distributes to three customers. The optimal solution is to send 120 units from Bogotá to Cali, 30 from Bogotá to Pasto, 60 from Tunja to Pasto, and 150 from Cúcuta to Chía, minimizing costs by $3,870.

    Original Description:

    The document presents a linear programming problem to minimize the transportation costs of a company that produces in three plants and distributes to three customers. The optimal solution is to send 120 units from Bogotá to Cali, 30 from Bogotá to Pasto, 60 from Tunja to Pasto, and 150 from Cúcuta to Chía, minimizing costs by $3,870.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document presents a linear programming problem to minimize the transportation costs of a company that produces in three plants and distributes to three customers. The optimal solution is to send 120 units from Bogotá to Cali, 30 from Bogotá to Pasto, 60 from Tunja to Pasto, and 150 from Cúcuta to Chía, minimizing costs by $3,870.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    8 views5 pages

    Linear Programming Workshop

    Uploaded by

    ScribdTranslations
    The document presents a linear programming problem to minimize the transportation costs of a company that produces in three plants and distributes to three customers. The optimal solution is to send 120 units from Bogotá to Cali, 30 from Bogotá to Pasto, 60 from Tunja to Pasto, and 150 from Cúcuta to Chía, minimizing costs by $3,870.

    Copyright:

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

    LINEAR PROGRAMMING WORKSHOP

     2. The Epsilon company produces tiles and tablets, which generate a profit
    contribution of $5000 and $4000 per square meter respectively. For the
    production of these articles, there is an availability of 200 square meters of sand
    and 240 square meters of cement per week. How much of each of the items
    should be manufactured, if it is known that to produce one square meter of tiles, 4
    square meters of sand and 3 square meters of cement are required; while to
    produce one square meter of tablet, 5 square meters of sand and 8 square
    meters of cement are required? Also assume that the customer guarantees to
    purchase at least 50 square meters of tablet.

    Data:
     Tiles:  Tablets:
     Profit: $5,000 m2  Profit: $4,000 m2
     Needed:  Needed:
     4m2 of sand  5m2 of sand
     3m2 of cement  8m2 of cement

    Availability per week:


     200m2 of sand
     240m2 of cement
    Solution:
    X 1 =¿ Quantity of tiles to be manufactured

    X 2 =¿ Number of tablets to be manufactured

    Objective Function:
    Maximizar → Z=5.000 X 1 + 4.000 X 2
    Restrictions:
    1) 4 X 1 +5 X 2 ≤200 → Arena
    2) 3 X 1 +8 X 2 ≤ 240→ Cemento
    3) X 2 ≥ 50
    Sign restriction:
    X1 ≥ 0 X2≥ 0
    Baldosas Tabletas
    5.
    000 4.000
    X1 X2
    0 30

    FUNCIÓN 120.00 TIPO MAXIMIZ


    OBJETIVO 0,00 : AR

    RESTRICCIO
    NES

    20 ARE
    150 <=
    1 0 NA
    24
    240 <= CEMENTO
    2 0
    30 >= 50
    3
    According to the data given to solve this exercise, there is no possible solution.

     8.6. The Oruga company manufactures its product in 3 plants located in Bogotá,
    Tunja and Cúcuta, in which there is a weekly production capacity of 150, 60 and
    180 units respectively. The product is distributed through 3 distributors located in
    Chía, Cali and Pasto for which a weekly demand of 150, 120 and 90 units
    respectively has been established.
    If it is known that the cost of transporting a unit from the plant from Bogotá to
    Chía is $15, to Cali it is $12 and to Pasto it is $9; from the plant located in Tunja
    to Chía it is $9, to Cali it is $12 and Pasto it is $6; while the same cost calculated
    for the plant located in Cúcuta is $12, $18 and $15 respectively for the
    distributors of Chía, Cali and Pasto; What quantity must be shipped from each
    plant to each distributor to generate a minimum total transportation cost?

    Data:

     3 plants (origin):  Distributors (destination):


     1) Bogota (150)  1) Chia (150)
     2) Tunja (60)  2) Cali (120)
     3) Cúcuta (180)  3) Grass (90)
     Total: 390  4) Villavicencio (30) Fictional.
     Weekly production  Total:390
    capacity.  Weekly distribution capacity.

    Solution:
    X ij =¿ Quantity of product shipped from the planti to the distributor j .

    COSTS
    ORIGIN DESTINY 1 2 3 4
    1 15 12 9 0
    2 9 12 6 0
    3 12 18 15 0

    Objective Function:

    Minimizar → Z=15 X 11 +12 X 12+ 9 X 13+ 9 X 21+ 12 X 22+6 X 23+12 X 31 +18 X 32+ 15 X 33

    Origin restrictions:

    1) X 11 + X 12+ X 13=150
    2) X 21 + X 22 + X 23=60
    3) X 31 + X 32 + X 33=180
    Destination restrictions:

    1) X 11 + X 21+ X 31=150
    2) X 12 + X 22 + X 32=120
    3) X 13 + X 23+ X 33=90
    4) X 14 + X 24 + X 34=30
    Sign restriction:
    X ij ≥ 0

    COSTOS
    ORIGEN / DESTINO 1 2 3 4
    1 15 12 9 0
    2 9 12 6 0
    3 12 18 15 0

    FUNCIÓN 3.870,0
    TIPO: MINIMIZAR
    OBJETIVO 0

    COSTOS
    ORIGEN / DESTINO 1 2 3 4
    1 0 120 30 0
    2 0 0 60 0
    3
    3 150 0 0
    0

    RESTRICCIONES

    RESTRICCIONES DE ORIGEN
    1 150 IGUAL 150
    2 60 IGUAL 60
    3 180 IGUAL 180

    RESTRICCIONES DE DESTINO
    1 150 IGUAL 150
    2 120 IGUAL 120
    3 90 IGUAL 90
    4 30 IGUAL 30
    According to the data given to solve this exercise, the solution is:
    From the Bogotá plant, 120 products will be sent to the Cali distributor and 30 products
    to the Pasto distributor. From the Tunja plant, 60 products will be sent to the Pasto
    distributor. From the Cúcuta plant, 150 products will be sent to Chía and There will be
    30 products left in this plant. The total price of transportation generates a cost of $3870
    per week.

    You might also like