In the Uncapacitated Facility Location (UCFL) problem, we are given (F⊎D,d) as well auxiliary information which specifies the cost fi of opening a facility at location i∈F. The goal is to open a subset of facilities in F to minimize the sum of the cost of the opened facilities and the total distance traveled by the clients to their nearest open facility.
In other words we want to solve
minF′⊆F(∑i∈Ffi+∑j∈Dd(j,F′)).
Consider the following LP formulation for the problem. We use a variable yi for i∈F to indicate whether i is opened or not. We use a variable xi,j to indicate whether j is assigned to i. One set of constraints are natural here: each client has to be assigned/connected to a facility. The other constraint requires that j is assigned to i only if i is open.
Consider the LP below:
mini∈F∑fiyi+j∈D∑i∈F∑d(i,j)xi,ji∑xi,j=Q∀j∈Dxi,j⩽yii∈F,j∈Dx,y⩾0
What is the correct value of Q?