Channel resource allocation/reallocation in cellular communication and linear programming

An approach aiming to formulate the mobile network resource allocation problem is proposed here. In order to formulate the resource allocation problem, the way network resources are to be counted is defined. Then, the resource allocation problem is expressed as a multidimensional knapsack problem. The knapsack problem is relaxed and a constrained optimisation linear programming problem is obtained. A series of pseudo-utility values is obtained from the solution of the linear programming problem. The pseudo-utility values are used to establish an order by which the calls/terminals/users are to be attended by the network.