Scribd Logo
Upload

Welcome to Scribd!

  • Taller Transbordo

    Uploaded by

    Felipe Gutierrez
    12 views11 pages
    The document appears to be describing a linear programming optimization problem involving transportation and demand. There are variables representing production at factories A-F and demand points H-K. The objective is to minimize total transportation costs while meeting production limits, demand requirements, and utilizing only allowed transportation routes between factories and demand points.

    Original Description:

    Original Title

    TALLER TRANSBORDO

    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 appears to be describing a linear programming optimization problem involving transportation and demand. There are variables representing production at factories A-F and demand points H-K. The objective is to minimize total transportation costs while meeting production limits, demand requirements, and utilizing only allowed transportation routes between factories and demand points.

    Copyright:

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

    Taller Transbordo

    Uploaded by

    Felipe Gutierrez
    The document appears to be describing a linear programming optimization problem involving transportation and demand. There are variables representing production at factories A-F and demand points H-K. The objective is to minimize total transportation costs while meeting production limits, demand requirements, and utilizing only allowed transportation routes between factories and demand points.

    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 11

    A B C D E F G H

    A 10000 10000 10000 500 1200 10000 10000 10000


    B 10000 10000 10000 10000 2000 10000 10000 10000
    C 10000 10000 10000 1300 2100 10000 10000 10000
    D 10000 10000 10000 10000 10000 1900 1300 10000
    E 10000 10000 10000 10000 10000 1450 1370 10000
    F 10000 10000 10000 10000 10000 10000 10000 2300
    G 10000 10000 10000 10000 10000 10000 10000 10000
    H 10000 10000 10000 10000 10000 10000 10000 10000
    I 10000 10000 10000 10000 10000 10000 10000 10000
    J 10000 10000 10000 10000 10000 10000 10000 10000
    K 10000 10000 10000 10000 10000 10000 10000 10000
    I J K
    10000 10000 10000
    10000 10000 10000
    10000 10000 10000
    10000 10000 10000
    10000 10000 10000
    2100 1700 10000
    1400 2300 1800
    10000 10000 10000
    10000 10000 10000
    10000 10000 10000
    10000 10000 10000
    XAA XAB XAC XAD XAE XAF XAG XAH XAI
    Obj 10000 10000 10000 500 1200 10000 10000 10000 10000
    Fabrica A Rest 1 1 1
    Fabrica B Rest 2
    Fabrica C Rest 3
    Transbordo D Rest 4 1
    Transbordo E Rest 5 1
    Transbordo F Rest 6
    Transbordo G Rest 7
    Demanda pura H Rest 8
    Demanda pura I Rest 9
    Demanda pura J Rest 10
    Demanda pura K Rest 11

    Solución XAA XAB XAC XAD XAE XAF XAG XAH XAI
    0 0 0 0.106 0 0 0 0 0
    XAJ XAK XBA XBB XBC XBD XBE XBF XBG XBH XBI XBJ XBK XCA XCB
    10000 10000 10000 10000 10000 10000 2000 10000 10000 10000 10000 10000 10000 10000 10000

    XAJ XAK XBA XBB XBC XBD XBE XBF XBG XBH XBI XBJ XBK XCA XCB
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    XCC XCD XCE XCF XCG XCH XCI XCJ XCK XDA XDB XDC XDD XDE XDF
    10000 1300 2100 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 10000 1900

    1 1
    1 -1
    1
    1

    XCC XCD XCE XCF XCG XCH XCI XCJ XCK XDA XDB XDC XDD XDE XDF
    0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
    XDG XDH XDI XDJ XDK XEA XEB XEC XED XEE XEF XEG XEH XEI XEJ
    1300 10000 10000 10000 10000 10000 10000 10000 10000 10000 1450 1370 10000 10000 10000

    -1
    -1 -1
    1
    1 1

    XDG XDH XDI XDJ XDK XEA XEB XEC XED XEE XEF XEG XEH XEI XEJ
    0.1056 0 0 0 0 0 0 0 0 0 - - - - -
    XEK XFA XFB XFC XFD XFE XFF XFG XFH XFI XFJ XFK XGA XGB XGC
    10000 10000 10000 10000 10000 10000 10000 10000 2300 2100 1400 10000 10000 10000 10000

    -1 -1 -1

    1 1 1
    1
    1

    XEK XFA XFB XFC XFD XFE XFF XFG XFH XFI XFJ XFK XGA XGB XGC
    - - - - - - - - - - - - - - -
    XGD XGE XGF XGG XGH XGI XGJ XGK Totales Signo LD
    10000 10000 10000 10000 10000 1400 2300 1800
    190 <= 190
    0.105555556 <= 90
    0 <= 130
    0 = 0
    0 = 0
    0 = 0
    -1 -1 -1 0 = 0
    0.105555556 = 110
    1 0 = 75
    1 0 = 65
    1 0 = 90

    XGD XGE XGF XGG XGH XGI XGJ XGK Z


    - - - - - - - - 190
    Matriz de Costos Variables de Decisión
    C D
    A A
    B B

    D E F G
    C C
    D D

    F G
    E E
    F F

    Función Obj Min Z=

    Restricciones
    Oferta 1
    Oferta 2
    Demanda Pura 1
    Transbordo con demanda 1
    Transbordo con demanda 2
    Transbordo puro 1
    Transbordo puro 2
    C D

    D E F G

    F G

    You might also like