The uncapacitated multi‐period facilities location problem with profit maximization

The literature on the facilities location problem is quite extensive with a wide variety of solution methods for addressing these problems where the objective is cost minimization. Develops a branch and bound algorithm for solving the uncapacitated, multi‐period facility location problem where the objective is to maximize profits. The solution method uses a number of simplification and branching decision rules to solve the problem efficiently. Extensive computational results on the algorithm’s performance are provided. The results indicate that the algorithm provides optimal solutions in substantially less time than LINDO.