Reference no: EM132247828

The Uncapacitated locaation Problem(UFLP) includes a constraint that requires every customer to be assigned to some facility. It is often the case that a small handful of customers in remote regions of the geographical area are difficult to serve and can influence the solution disproportionately. In this problem, you will formulate the version of the UFLP in which a certain percentage of the deman =d may be ignored when calculating the objective function. Let α be the minimum fraction of demands to be assigned; that it , a set of customers whose cumulative demand is no more than 100(1−α)% of the total demand may be ignored. The parameter α is fixed, but the model decides edngenously which customers to ignore. Customers mus either be assigned or not, they cannot be fractionally assigned. (a) Formulate the linear integer programming problem. (b) Explain your objective and constraints in words (c) Consider adding a dummy facility, call it u, to the original UFLP. Facility u has a fixed capacity, so we are now dealing with the capacitated fixed charge location problem(CFLP), not the UFLP. Explain how to set the dummy facility’s parameters - its fixed cost, capacity and transportation cost to each customer, so that solving the CFLP with the dummy facility is equivalent to solving the above problem. Formulate the resulting integer programming problem.