Scribd Logo
Upload

Welcome to Scribd!

  • IOA Desafío 5B Solución

    Uploaded by

    sebastian.pino.azocar
    9 views3 pages
    The document is about solving a multi-stage minimization problem using dynamic programming. It defines an objective function to minimize at each stage based on costs and variables from the current and next stages. It then calculates the optimal values of the variables and objective function at each stage by evaluating all possible combinations in a backward recursive manner.

    Original Description:

    Original Title

    IOA_Desafío_5B_Solución

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is about solving a multi-stage minimization problem using dynamic programming. It defines an objective function to minimize at each stage based on costs and variables from the current and next stages. It then calculates the optimal values of the variables and objective function at each stage by evaluating all possible combinations in a backward recursive manner.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    9 views3 pages

    IOA Desafío 5B Solución

    Uploaded by

    sebastian.pino.azocar
    The document is about solving a multi-stage minimization problem using dynamic programming. It defines an objective function to minimize at each stage based on costs and variables from the current and next stages. It then calculates the optimal values of the variables and objective function at each stage by evaluating all possible combinations in a backward recursive manner.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 3

    Universidad Austral de Chile - Sede Puerto Montt

    Instituto de Gestión e Industrias


    Ingeniería Civil Industrial
    II Semestre 2023

    (𝑠𝑛 )
    (𝑥𝑛 )

    ∗ (𝑠
    𝑀in 𝑓𝑛 (𝑠𝑛 , 𝑥𝑛 ) = Cp 𝑥𝑛 + Cs (𝑠𝑛 + 𝑥𝑛 − d𝑛 ) + 4𝑚𝑖𝑛{1, 𝑥𝑛 } + 𝑓𝑛+1 𝑛 + 𝑥𝑛 − d𝑛 )

    Cp

    Cs

    d𝑛

    4𝑚𝑖𝑛1, 𝑥𝑛
    ∗ (𝑠
    𝑓𝑛+1 𝑛 + 𝑥𝑛 − d𝑛 )

    s1 = 1

    s5 = 1

    Investigación de Operaciones Avanzada – Prof. Marcos González


    Universidad Austral de Chile - Sede Puerto Montt
    Instituto de Gestión e Industrias
    Ingeniería Civil Industrial
    II Semestre 2023

    Min 𝑓4 (s4 , x4 ) = 2x4 + 1 ∗ (s4 + x4 − 2) + 4𝑚𝑖𝑛{1, 𝑥𝑛 }


    𝑆4 𝑓4∗ (𝑠3 ) 𝑥4∗
    x4 = 0 x4 = 1 x4 = 2 x4 = 3 x4 = 4 x4 = 5 x4 = 6
    6 + 1 + 4 = 11
    4+1+4=9
    2+1+4=7
    0+1=1

    𝑆3
    𝑓3 (𝑠3 , 𝑥3 ) = 2𝑥3 + 1 ∗ (𝑠3 + 𝑥3 − 3) + 4𝑚𝑖𝑛{1, 𝑥3 }+𝑓4 (𝑠3 + 𝑥3 − 3) 𝑓3∗ (𝑠3 ) 𝑥3∗
    𝑥3 = 0 𝑥3 = 1 𝑥3 = 2 𝑥3 = 3 𝑥3 = 4 𝑥3 = 5 𝑥3 = 6
    6+0+4 8+1+4 10 + 2 + 4 12 + 3 + 4
    + 11 = 21 + 9 = 22 + 7 = 23 + 1 = 20
    4+0+4 6+1+4 8+2+4 10 + 3 + 4
    + 11 = 19 + 9 = 20 + 7 = 21 + 1 = 18
    2+0+4 4+1+4 6+2+4 8+3+4
    + 11 = 17 + 9 = 18 + 7 = 19 + 1 = 16
    11 2+1+4 4+2+4 6+3+4
    = 11 + 9 = 16 + 7 = 17 + 1 = 14
    1+9 2+2+4 4+3+4
    = 10 + 7 = 15 + 1 = 12
    2+7 2+3+4
    =9 + 1 = 10

    𝑓2 (𝑠2 , 𝑥2 ) = 2𝑥2 + 1 ∗ (𝑠2 + 𝑥2 − 1) + 4𝑚𝑖𝑛{1, 𝑥2 }+𝑓3 (𝑠2 + 𝑥2 − 1)


    𝑆2 𝑓2∗ (𝑠2 ) 𝑥2∗
    𝑥2 = 0 𝑥2 = 1 𝑥2 = 2 𝑥2 = 3 𝑥2 = 4 𝑥2 = 5 𝑥2 = 6
    2+0+4 4+1+4 6+2+4 8+3+4 10 + 4 + 4 12 + 5 + 4
    + 20 = 26 + 18 = 27 + 16 = 28 + 11 = 26 + 10 = 28 + 9 = 30
    0+0 2+1+4 4+2+4 6+3+4 8+4+4 10 + 5 + 4
    + 20 + 18 = 25 + 16 = 26 + 11 = 24 + 10 = 26 + 9 = 28
    = 20
    0+1 2+2+4 4+3+4 6+4+4 8+5+4
    + 18 + 16 = 24 + 11 = 22 + 10 = 24 + 9 = 26
    = 19
    0+2 2+3+4 4+4+4 6+5+4
    + 16 + 11 = 20 + 10 = 22 + 9 = 24
    = 18
    0+3 2+4+4 4+5+4
    + 11 + 10 = 20 + 9 = 22
    = 14
    0+4 2+5+4
    + 10 + 9 = 20
    = 14

    Investigación de Operaciones Avanzada – Prof. Marcos González


    Universidad Austral de Chile - Sede Puerto Montt
    Instituto de Gestión e Industrias
    Ingeniería Civil Industrial
    II Semestre 2023

    𝑓1 (𝑠1 , 𝑥1 ) = 2𝑥1 + 1 ∗ (𝑠1 + 𝑥1 − 2) + 4𝑚𝑖𝑛{1, 𝑥1 }+𝑓2 (𝑠1 + 𝑥1 − 2)


    𝑆1 𝑓1∗ (𝑠1 ) 𝑥1∗
    𝑥1 = 0 𝑥1 = 1 𝑥1 = 2 𝑥1 = 3 𝑥1 = 4 𝑥1 = 5 𝑥1 = 6
    2+0+4 4+1+4 6+2+4 8+3+4 10 + 4 + 4 12 + 5 + 4
    + 26 = 32 + 20 = 29 + 19 = 31 + 18 = 33 + 14 = 32 + 14 = 35

    𝑥1∗ = 2 𝑠2 = 𝑠1 + 𝑥1 − 2

    𝑠2 = 1 + 2 − 2 = 1

    𝑥2∗ = 0 𝑠3 = 𝑠2 + 𝑥2 − 1

    𝑠3 = 1 + 0 − 1 = 0

    𝑥3∗ = 6 𝑠4 = 𝑠3 + 𝑥3 − 3

    𝑠4 = 0 + 6 − 3 = 3

    𝑥4∗ = 0

    Investigación de Operaciones Avanzada – Prof. Marcos González

    You might also like