Scribd Logo
Upload

Welcome to Scribd!

  • Intento PCENTER

    Uploaded by

    IGNACIO ISRAEL FLORES TORRES
    10 views3 pages
    This document presents an example problem (P-CENTER) and integer linear programming model to minimize the maximum distance between customers and facilities. The objective is to minimize w, subject to constraints that: (1) at least one facility is assigned to each customer, (2) the total number of open facilities is equal to P, (3) a customer can only be assigned to an open facility, and (4) the distance between a customer and assigned facility must be less than or equal to w. The model contains 8 customers, 10 potential facilities, and distances between each customer-facility pair.

    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 example problem (P-CENTER) and integer linear programming model to minimize the maximum distance between customers and facilities. The objective is to minimize w, subject to constraints that: (1) at least one facility is assigned to each customer, (2) the total number of open facilities is equal to P, (3) a customer can only be assigned to an open facility, and (4) the distance between a customer and assigned facility must be less than or equal to w. The model contains 8 customers, 10 potential facilities, and distances between each customer-facility pair.

    Copyright:

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

    Intento PCENTER

    Uploaded by

    IGNACIO ISRAEL FLORES TORRES
    This document presents an example problem (P-CENTER) and integer linear programming model to minimize the maximum distance between customers and facilities. The objective is to minimize w, subject to constraints that: (1) at least one facility is assigned to each customer, (2) the total number of open facilities is equal to P, (3) a customer can only be assigned to an open facility, and (4) the distance between a customer and assigned facility must be less than or equal to w. The model contains 8 customers, 10 potential facilities, and distances between each customer-facility pair.

    Copyright:

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

    obj 0

    re1 0 >= 1
    re2 0 >= 1
    re3 0 >= 1
    Re4 2 igual 2 P=2
    w 0
    xij yi xij*dij
    ejemplo 0 0 0 0 0 0 0
    0 0 0 0 0 0 0
    0 0 0 0 0 0 0
    dij cj dij*cj
    18 12 15 2 3 1 36 36 15
    11 9 14 22 27 14
    16 10 17 32 30 17

    Ejemplo Problema P-CENTER


    Min Max i en j;j en J (xijdij) P=2
    RESTRICCIONES:
    sum(i) xij >= 1 j =1,2,3
    sum(i) yi = P
    xij<= yi i=1,2,3; j= 1,2,3
    xij binarias i=1,2,3; j= 1,2,3
    yi binarias i=1,2,3
    El modelo es equivalente a:
    Min w
    RESTRICCIONES:
    sum(i) xij >= 1 j =1,2,3
    sum(i) yi = P
    xij<= yi i=1,2,3; j= 1,2,3
    xijdij<= w i=1,2,3;j=1,2,3
    xij binarias i=1,2,3; j= 1,2,3
    yi binarias i=1,2,3
    Obj 0
    Re1 0 <= 1
    Re2 0 <= 1
    Re3 0 <= 1
    Re4 0 <= 1
    Re5 0 <= 1
    Re6 0 <= 1
    Re7 0 <= 1
    Re8 0 <= 1
    Re9 0 <= 1
    Re10 0 <= 1
    Re11 0 Igual 6
    W 0
    Xij
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0
    Dij
    6 4 7 8 5 9 6 4 8 7
    7 9 5 7 9 8 3 6 9 5
    3 6 4 2 5 3 8 5 6 3
    4 5 6 7 4 5 3 4 7 6
    5 7 3 6 7 4 5 8 4 8
    8 4 2 4 3 6 4 7 3 4
    5 5 6 7 3 4 8 5 4 6
    4 7 8 6 4 3 2 8 5 7

    Min Max i en j;j en J (xijdij)


    RESTRICCIONES:
    sum(i) xij >= 1 j =1,2,3,4,5,6,7,8,9,10
    sum(i) yi = P
    xij<= yi i=1,2,3,4,5,6,7,8; j= 1,2,3,4,5,6,7,8,9,10
    xij binarias i=1,2,3,4,5,6,7,8; j= 1,2,3,4,5,6,7,8,9,10
    yi binarias i=1,2,3,4,5,6,7,8
    Yi Xij
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0
    0 0 0 0 0 0 0 0 0 0 0

    You might also like