# Euclidean single facility location problem
# Objective Function: convex
# Constraint Functions: second-order cone
# Feasible Set: convex
param m := 200; # number of existing facilities
param n1 := 5;
param n2 := 5;
param n := n1*n2; # number of new facilities
param a {1..m, 1..2}; # coordinates of existing facility
param w {1..m, 1..n}; # weights associated with old-new connections
param v {1..n, 1..n}; # weights associated with new-new connections
var x {1..n, 1..2};
var s {1..m, 1..n} >= 0;
var t {j in 1..n, jj in 1..n: j < jj} >= 0;
minimize sumEucl:
sum {i in 1..m, j in 1..n}
w[i,j]*s[i,j]
+
sum {j in 1..n, jj in 1..n: j