Scribd Logo
Upload

Welcome to Scribd!

  • Programacion INVESTIGACION OPERATIVA

    Uploaded by

    Williams Eduardo Gonzalez Fernandez
    7 views5 pages
    The document describes an optimization problem to minimize transportation costs given supply and demand constraints across multiple plants, warehouses, and customers. The objective is to assign shipment quantities from plants to warehouses and warehouses to customers at minimum cost while meeting all constraints. Multiple sections provide the objective function and constraints for different modeling approaches, including basic transportation, trans-shipments, and finding shortest routes.

    Original Description:

    Original Title

    programacion INVESTIGACION OPERATIVA

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an optimization problem to minimize transportation costs given supply and demand constraints across multiple plants, warehouses, and customers. The objective is to assign shipment quantities from plants to warehouses and warehouses to customers at minimum cost while meeting all constraints. Multiple sections provide the objective function and constraints for different modeling approaches, including basic transportation, trans-shipments, and finding shortest routes.

    Copyright:

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

    Programacion INVESTIGACION OPERATIVA

    Uploaded by

    Williams Eduardo Gonzalez Fernandez
    The document describes an optimization problem to minimize transportation costs given supply and demand constraints across multiple plants, warehouses, and customers. The objective is to assign shipment quantities from plants to warehouses and warehouses to customers at minimum cost while meeting all constraints. Multiple sections provide the objective function and constraints for different modeling approaches, including basic transportation, trans-shipments, and finding shortest routes.

    Copyright:

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

    TRANSPORTE

    !FUNCION OBJETIVO:

    min = 11*x11 +17*x12 +8*x13 +16*x14 +20*x15


    +9*x21 +7*x22 +12*x23 +6*x24 +15*x25
    +13*x31 +16*x32 +15*x33 +12*x34 +16*x35
    +21*x41 +24*x42 +17*x43 +28*x44 +26*x45
    +14*x51 +10*x52 +12*x53 +11*x54 +15*x55;
    S.T.

    ! RESTRICCIONES DE SUMINISTRO:

    x11 +x12 +x13 +x14 +x15 <= 000;


    x21 +x22 +x23 +x24 +x25 <= 000;
    x31 +x32 +x33 +x34 +x35 <= 000;
    x41 +x42 +x43 +x44 +x45 < =1000;
    x51 +x52 +x53 +x54 +x55 <=1000;

    ! RESTRICCIONES DE DEMANDA:

    x11 +x21 +x31 +x41 +x51 =000;


    x12 +x22 +x32 +x42 +x52 =000;
    x13 +x23 +x33 +x43 +x53 =000;
    x14 +x24 +x34 +x44 +x54 =000;
    x15 +x25 +x35 +x45 +x55 =000;
    TRANSBORDO

    !FUNCION OBJETIVO:

    min = 11*x11 +17*x12 +8*x13 +16*x14 +20*x15


    +9*x21 +7*x22 +12*x23 +6*x24 +15*x25 todas las redes
    +13*x31 +16*x32 +15*x33 +12*x34 +16*x35
    +21*x41 +24*x42 +17*x43 +28*x44 +26*x45
    +14*x51 +10*x52 +12*x53 +11*x54 +15*x55;
    S.T.

    ! RESTRICCIONES DE SUMINISTRO:

    x11 +x12 +x13 +x14 +x15 <= 000;


    x21 +x22 +x23 +x24 +x25 <= 000; unidades enviadas de cada
    x31 +x32 +x33 +x34 +x35 <= 000; planta a cada almacén
    x41 +x42 +x43 +x44 +x45 < =1000;
    x51 +x52 +x53 +x54 +x55 <=1000;

    ! RESTRICCIONES DE TRANSBORDO:

    x11 +x21 +x31 +x41 +x51 =0; unidades que entran (menos)
    x12 +x22 +x32 +x42 +x52 =0; unidades que salen
    x13 +x23 +x33 +x43 +x53 =0;
    x14 +x24 +x34 +x44 +x54 =0;
    x15 +x25 +x35 +x45 +x55 =0;

    ! RESTRICCIONES DE DEMANDA:
    x13 +x23 +x33 +x43 +x53 =000;los que entran a la demanda
    x14 +x24 +x34 +x44 +x54 =000;
    x15 +x25 +x35 +x45 +x55 =000;
    ASIGNACION

    !FUNCION OBJETIVO:

    min = 11*x11 +17*x12 +8*x13 +16*x14 +20*x15


    +9*x21 +7*x22 +12*x23 +6*x24 +15*x25
    +13*x31 +16*x32 +15*x33 +12*x34 +16*x35
    +21*x41 +24*x42 +17*x43 +28*x44 +26*x45
    +14*x51 +10*x52 +12*x53 +11*x54 +15*x55;
    S.T.

    ! RESTRICCIONES DE SUMINISTRO:

    x11 +x12 +x13 +x14 +x15 <= 1000;


    x21 +x22 +x23 +x24 +x25 <= 1000;
    x31 +x32 +x33 +x34 +x35 <= 1000;
    x41 +x42 +x43 +x44 +x45 < =1000;
    x51 +x52 +x53 +x54 +x55 <=1000;

    ! RESTRICCIONES DE DEMANDA:

    x11 +x21 +x31 +x41 +x51 =1000;


    x12 +x22 +x32 +x42 +x52 =1000;
    x13 +x23 +x33 +x43 +x53 =1000;
    x14 +x24 +x34 +x44 +x54 =1000;
    x15 +x25 +x35 +x45 +x55 =1000;

    sumar precio de ventas mas el costo de distribución


    precio= multiplicar el precio de demanda por el precio del proveedor
    costo= multiplicar el precio de demanda por el costo de distribuir
    RUTA CORTA

    !FUNCION OBJETIVO:

    min = 11*x11 +17*x12 +8*x13 +16*x14 +20*x15


    +9*x21 +7*x22 +12*x23 +6*x24 +15*x25
    +13*x31 +16*x32 +15*x33 +12*x34 +16*x35
    +21*x41 +24*x42 +17*x43 +28*x44 +26*x45
    +14*x51 +10*x52 +12*x53 +11*x54 +15*x55;
    S.T.

    ! RESTRICCIONES:

    x11 +x12 +x13 +x14 +x15 = 1; flujo entrante = flujo saliente


    x21 +x22 +x23 +x24 +x25 = 000; positivo negativo
    x31 +x32 +x33 +x34 +x35 = 000;
    x41 +x42 +x43 +x44 +x45 =000;
    x51 +x52 +x53 +x54 +x55 =1;
    FLUJO MAXIMO escoger ruta con valor máximo se resta el valos minimo

    !FUNCION OBJETIVO:

    min = 11*x11 +17*x12 +8*x13 +16*x14 +20*x15


    +9*x21 +7*x22 +12*x23 +6*x24 +15*x25
    +13*x31 +16*x32 +15*x33 +12*x34 +16*x35
    +21*x41 +24*x42 +17*x43 +28*x44 +26*x45
    +14*x51 +10*x52 +12*x53 +11*x54 +15*x55;
    S.T.

    ! RESTRICCIONES DE SUMINISTRO:

    x11 +x12 +x13 +x14 +x15 <= 000;


    x21 +x22 +x23 +x24 +x25 <= 000;
    x31 +x32 +x33 +x34 +x35 <= 000;
    x41 +x42 +x43 +x44 +x45 < =1000;
    x51 +x52 +x53 +x54 +x55 <=1000;

    ! RESTRICCIONES DE DEMANDA:

    x11 +x21 +x31 +x41 +x51 =000;


    x12 +x22 +x32 +x42 +x52 =000;
    x13 +x23 +x33 +x43 +x53 =000;
    x14 +x24 +x34 +x44 +x54 =000;
    x15 +x25 +x35 +x45 +x55 =000;

    You might also like