This article presents algorithms for the optimization of radio resources and proposes an optimization model that can be implemented in dynamic mobile networks based on RoF. The algorithms are based on linear relaxation technique for integer linear programming (ILP) problems. The formulation models a multi-tier structure of antennas with increasing radius. Considering this antenna structure the optimizer performs dynamic cell merging and cell splitting in the coverage area for saving resources and yet improving network availability. Both the integer and the relaxation formulations showed similar results for all the experiments, but the time of processing required by the relaxation algorithms was much shorter than that required by the integer algorithm for large instances of the problem, which highlights the advantages of relaxation techniques under time constraints.