Scribd Logo
Upload

Welcome to Scribd!

  • Invope2 Eje Asigna 3 (Sol General)

    Uploaded by

    Miguel Saiht Cadenillas Delgado
    4 views6 pages
    The document outlines a multi-stage optimization problem to allocate agents across 4 locations - Lima, Trujillo, Arequipa, and Piura. It defines a recursive function to calculate the maximum benefit at each stage based on benefits and future stage allocations. The solution allocates 1 agent to Lima and Trujillo each, and 2 agents to Arequipa, for a total benefit of 730 thousand dollars.

    Original Description:

    Ejercicio de INVOPE 2

    Original Title

    INVOPE2-EJE-ASIGNA-3-(SOL-GENERAL)

    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 outlines a multi-stage optimization problem to allocate agents across 4 locations - Lima, Trujillo, Arequipa, and Piura. It defines a recursive function to calculate the maximum benefit at each stage based on benefits and future stage allocations. The solution allocates 1 agent to Lima and Trujillo each, and 2 agents to Arequipa, for a total benefit of 730 thousand dollars.

    Copyright:

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

    Invope2 Eje Asigna 3 (Sol General)

    Uploaded by

    Miguel Saiht Cadenillas Delgado
    The document outlines a multi-stage optimization problem to allocate agents across 4 locations - Lima, Trujillo, Arequipa, and Piura. It defines a recursive function to calculate the maximum benefit at each stage based on benefits and future stage allocations. The solution allocates 1 agent to Lima and Trujillo each, and 2 agents to Arequipa, for a total benefit of 730 thousand dollars.

    Copyright:

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

    ETAPAS 1, 2, 3, 4

    AGENTES LIMA TRUJILLO AREQUIPA PIURA 1: LIMA 3:AREQUIPA


    1 150 160 165 230 2: TRUJILL 4: PIURA
    2 170 180 190 210 VARIABL Xi (DECISIONES)
    3 190 200 200 220 ESTADOSSi (DISPONE) 0, 1, 2, 3, 4, 5
    4 220 220 225 230 FUNCIÓN RECURSIVA:
    5 180 190 195 210 fi(Si, Xi) = Max { Ri(XI) + f(i+1)(Si - Xi) }

    ETAPA 4: PIURA
    S4 X4= 0 X4= 1 X4= 2 X4= 3
    0 0
    1 0 230
    2 0 230 210
    3 0 230 210 220
    4 0 230 210 220
    5 0 230 210 220

    ETAPA 3: AREQUIPA
    S3 X3= 0 X3= 1 X3= 2 X3= 3
    0 0
    1 230 165
    2 230 395 190
    3 230 395 420 200
    4 230 395 420 430
    5 230 395 420 430

    ETAPA 2: TRUJILLO
    S2 X2=0 X2=1 X2=2 X2=3
    0 0
    1 230 160
    2 395 390 180
    3 420 555 410 200
    4 430 580 575 430
    5 455 590 600 595

    ETAPA 1: LIMA
    S1 X1=0 X1=1 X1=2 X1=3
    0 0
    1 230 150
    2 395 380 170
    3 555 545 400 190
    4 580 705 565 420
    5 600 730 725 585
    f4(S4, X4) = Max { R4(X4) }
    X4= 4 X4= 5 f*4(X4) X*4
    0 0
    230 1
    230 1
    230 1
    230 230 1, 4
    230 210 230 1, 4

    f3(S3, X3) = Max { R3(X3) + f4(S3-X3) } f4(S3-X3) = f4(2 -2) = f(0) = 0


    X3= 4 X3= 5 f*3(X3) X*3 S3 = 2 X3 = 2
    0 0
    230 0 f4(S3-X3) = f4(3-2) = f(1) = 230
    395 1 S3 = 3 X3 = 2
    420 2
    225 430 3
    455 195 455 4

    f2(S2, X2) = Max { R2(X2) + f3(S2-X2) }


    X2=4 X2=5 f*2(X2) X*2
    0 0
    230 0
    395 0
    555 1
    220 580 1
    450 190 600 2

    f1(S1, X1) = Max { R1(X1) + f2(S1-X1) }


    X1=4 X1=5 f*1(X1) X*1
    0 0
    230 0 SOLUCIÓN
    395 0 CIUDAD LIMA TRUJILLO AREQUIPA
    555 0 CANTIDAD 1 1 2
    220 705 1 BENEFICIO 150 160 190
    450 180 730 1
    A UN BENEFICIO MÁXIMO DE 730 MIL DÓLARES
    PIURA TOTAL
    1 5
    230 730

    MIL DÓLARES

    You might also like