Scribd Logo
Upload

Welcome to Scribd!

  • Ejemplo Pmedia

    Uploaded by

    Stephanya Lopez
    8 views3 pages
    This document presents an optimization problem with 6 origins and 6 destinations. It provides the distances between each origin-destination pair and defines three constraints: 1) the total number of shipments from each origin must be 2 on average, 2) each destination can only receive from one origin, and 3) if a destination is selected, it must receive from the origin assigned to it. The solution shows one shipment from origin 1 to destination 5 and one from origin 2 to destination 5, satisfying all the constraints.

    Original Description:

    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 with 6 origins and 6 destinations. It provides the distances between each origin-destination pair and defines three constraints: 1) the total number of shipments from each origin must be 2 on average, 2) each destination can only receive from one origin, and 3) if a destination is selected, it must receive from the origin assigned to it. The solution shows one shipment from origin 1 to destination 5 and one from origin 2 to destination 5, satisfying all the constraints.

    Copyright:

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

    Ejemplo Pmedia

    Uploaded by

    Stephanya Lopez
    This document presents an optimization problem with 6 origins and 6 destinations. It provides the distances between each origin-destination pair and defines three constraints: 1) the total number of shipments from each origin must be 2 on average, 2) each destination can only receive from one origin, and 3) if a destination is selected, it must receive from the origin assigned to it. The solution shows one shipment from origin 1 to destination 5 and one from origin 2 to destination 5, satisfying all the constraints.

    Copyright:

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

    ORIGEN (i)

    1 2 3 4 5 6
    1 0 8 2 2 7 6
    2 8 0 7 6 3 4
    DESTINO ( j )

    3 2 7 0 4 8 4
    4 2 6 4 0 6 9
    5 7 3 8 6 0 3
    6 6 4 4 9 3 0

    SOLUCIONES
    1 2 3 4 5 6
    1 1 0 1 1 0 0
    2 0 0 0 0 0 0
    3 0 0 0 0 0 0
    4 0 0 0 0 0 0
    5 0 1 0 0 1 1
    6 0 0 0 0 0 0
    FO.. 10

    RESTRICCIONES
    Primera Restriccion
    2 "=" 2 #P medias

    Segunda restriccion Envio a un solo cliente


    1 "=" 1
    1 "=" 1

    1 solo cliente
    1 "=" 1
    1 "=" 1
    1 "=" 1
    1 "=" 1

    Tercera Restriccion "Cada Cliente asignado a una mediana si es eleccionada"


    X11 1 "<=" 1 X11 X41 1
    X12 0 "<=" 0 X22 X42 0
    X13 0 "<=" 0 X33 X43 0
    X14 0 "<=" 0 X44 X44 0
    X15 0 "<=" 1 X55 X45 0
    X16 0 "<=" 0 X66 X46 0
    X21 0 "<=" 1 X11 X51 0
    X22 0 "<=" 0 X22 X52 0
    X23 0 "<=" 0 X33 X53 0
    X24 0 "<=" 0 X44 X54 0
    X25 1 "<=" 1 X55 X55 1
    X26 0 "<=" 0 X66 X56 0
    X31 1 "<=" 1 X11 X61 0
    X32 0 "<=" 0 X22 X62 0
    X33 0 "<=" 0 X33 X63 0
    X34 0 "<=" 0 X44 X64 0
    X35 0 "<=" 1 X55 X65 1
    X36 0 "<=" 0 X66 X66 0
    diana si es eleccionada"
    "<=" 1 X11
    "<=" 0 X22
    "<=" 0 X33
    "<=" 0 X44
    "<=" 1 X55
    "<=" 0 X66
    "<=" 1 X11
    "<=" 0 X22
    "<=" 0 X33
    "<=" 0 X44
    "<=" 1 X55
    "<=" 0 X66
    "<=" 1 X11
    "<=" 0 X22
    "<=" 0 X33
    "<=" 0 X44
    "<=" 1 X55
    "<=" 0 X66

    You might also like