Scribd Logo
Upload

Welcome to Scribd!

  • Costo Total Variables PA PB PC A1 A2 B1 B2 C1 C2 1D 2E DV EV

    Uploaded by

    PaulAlexanderCG
    6 views5 pages
    This document presents an optimization problem to minimize total cost subject to balance, minimum capacity, and maximum capacity constraints. There are 13 variables including products P, A, B, C, and intermediates 1, 2, D, E, and V. The optimal solution has a total cost of -12800 and satisfies all the constraints with multiple possible optimal solutions due to equivalent minimum costs for producing through paths B or C, or increasing production of B up to its maximum.

    Original Description:

    excel

    Original Title

    a 3

    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 minimize total cost subject to balance, minimum capacity, and maximum capacity constraints. There are 13 variables including products P, A, B, C, and intermediates 1, 2, D, E, and V. The optimal solution has a total cost of -12800 and satisfies all the constraints with multiple possible optimal solutions due to equivalent minimum costs for producing through paths B or C, or increasing production of B up to its maximum.

    Copyright:

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

    Costo Total Variables PA PB PC A1 A2 B1 B2 C1 C2 1D 2E DV EV

    Uploaded by

    PaulAlexanderCG
    This document presents an optimization problem to minimize total cost subject to balance, minimum capacity, and maximum capacity constraints. There are 13 variables including products P, A, B, C, and intermediates 1, 2, D, E, and V. The optimal solution has a total cost of -12800 and satisfies all the constraints with multiple possible optimal solutions due to equivalent minimum costs for producing through paths B or C, or increasing production of B up to its maximum.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5

    Costo total -12800 (minimización)

    Variables PA PB PC A1 A2 B1 B2 C1 C2 1D 2E DV EV
    Costo 25 26 27 4 5 4 6 3 5 10 12 -60 -64
    Valor 600 200 400 0 600 0 200 400 0 400 800 300 700
    Restricciones
    Balances:
    P 1 1 1
    A -1 1 1
    B -1 1 1
    C -1 1 1
    1 -1 -1 -1 1
    2 -1 -1 -1 1
    D -1 1
    E -1 1
    V -1 -1
    Cap. Min.:
    PA 1
    PB 1
    PC 1
    A1 1
    A2 1
    B1 1
    B2 1
    C1 1
    C2 1
    1D 1
    2E 1
    DV 1
    EV 1
    Cap. Max.:
    PA 1
    PB 1
    PC 1
    A1 1
    A2 1
    B1 1
    B2 1
    C1 1
    C2 1
    1D 1
    2E 1
    DV 1
    EV 1
    13 variables

    Lizq Lder
    Balances:
    1200 = 1200 P
    0 = 0 A
    0 = 0 B
    0 = 0 C
    0 = 0 1
    0 = 0 2
    -100 = -100 D
    -100 = -100 E
    -1000 = -1000 V
    Cap. Min.:
    600 >= 0 PA
    200 >= 0 PB
    400 >= 0 PC
    0 >= 0 A1
    600 >= 0 A2
    0 >= 0 B1
    200 >= 0 B2
    400 >= 0 C1
    0 >= 0 C2
    400 >= 0 1D
    800 >= 0 2E 600
    300 >= 300 DV
    700 >= 600 EV
    Cap. Max.:
    600
    600 <= 600 PA
    200 <= 500 PB
    400 <= 800 PC
    0 <= 1000 A1 200
    600 <= 1000 A2 200
    0 <= 1000 B1
    200 <= 1000 B2
    400 <= 1000 C1 400
    0 <= 1000 C2 400
    400 <= 800 1D
    800 <= 900 2E
    300 <= 600 DV
    700 <= 800 EV
    ACOTAR ADEMAS QUE TIENE MAS DE UNA SOLUCION PUES
    EL PUNTO "B" O "C" POSEEN EL MISMO COSTO CONJUNTO
    POR "C" O SUBIR HASTA 600 EN LO QUE SE DI
    400 300

    700

    800
    DE UNA SOLUCION PUES EL COSTO DE "P" HASTA "2" PASANDO POR
    SMO COSTO CONJUNTO POR LO QUE PODRIA PASAR SOLO LOS 400
    TA 600 EN LO QUE SE DISMINUYE LO QUE VA POR "B".

    You might also like