param n;#dépots
param m;#clients

set N:=1..n;
set M:=1..m;

param f{j in N};
param c{i in M, j in N};

var x{i in M, j in N} >=0;
var y{j in N} binary;

minimize cost: sum{i in M, j in N} c[i,j] * x[i,j] + sum{j in N} f[j] * y[j];

s.t.
affectation{i in M} : sum{j in N} x[i,j] = 1;
cout_fixe{i in M, j in N} : x[i,j] <= y[j];


end;