These inequalities ensure that if there is no open facility in the k th preferred location for customer j , then the customer must be allocated to a facility whose location is less preferred than the k th location or their demand is not allocated to any open facility. Then, the problem can be modelled with the following single-level mathematical programming model.