Documentos de Académico
Documentos de Profesional
Documentos de Cultura
X1 + X2 ≥ 1 (Calle A)
X2 + X3 ≥ 1 (Calle B)
X4 + X5 ≥ 1 (Calle C)
X7 + X8 ≥ 1 (Calle D)
X6 + X7 ≥ 1 (Calle E)
X2 + X6 ≥ 1 (Calle F)
X1 + X6 ≥ 1 (Calle G)
X4 + X7 ≥ 1 (Calle H)
X2 + X4 ≥ 1 (Calle I)
X5 + X8 ≥ 1 (Calle J)
X3 + X5 ≥ 1 (Calle K)
Sea Xi: la ruta elegida i=1…6, Xi es binario Xi=1 si se elige la ruta, 0 caso
contrario
Restricciones : clientes
X1 + X3 + X5 + X6 ≥1 (Cliente 1)
X1 + X3 + X4 + X5 ≥1 (Cliente 2)
X1 + X2 + X4 + X6 ≥1 (Cliente 3)
X1 + X2 + X5 ≥1 (Cliente 4)
X2 + X3 + X4 + X6 ≥1 (Cliente 5)
Restricciones
X1 = X3 X1 ≥ X3 X1 ≤ X3
1=1 1 0,1 1 1
Restricciones
Mutuamente excluyentes
X1 + X2 = 1
X1 + X2 + X3 + X4 = 1
X = 10
3x1 + 2x2 ≤ 18 O x1 + 4x2 ≤ 16
[(3x1 + 2x2 ≤ 18 ) Y (x1 + 4x2 ≤ 16 + M)] O [(3x1 + 2x2 ≤ 18 + M ) Y (x1 + 4x2 ≤ 16)] M: MUY
GRANDE
Comprobando
3x1 + 2x2 ≤ 18
x1 + 4x2 ≤ 16
COSTO FIJO
C= {F +cx , x> 0
0 , x=0
C = Fy + cx