“…Other classical optimisation tools used for solving well-defined linear or convex programming RA problems are mostly off-shots of either the simplex or the interior point methods. Some of the most common methods and the corresponding references where they have been employed in obtaining solutions to RA problems in CRN are as follows: branch-and-bound (BnB) [19,45], branchand-cut (BnC) [46], lift-and-shift (LnS) [47], iterative and double-loop iterative methods [21,23], dual decomposition [21,48], Lagrangian duality [48,49], barrier method [50,51], gradient decent approach [52], column generation [53,54] etc. In general, these methods, because of their advantage of obtaining optimal solutions, are highly significant.…”