

which is a minimization problem but still difficult to solve due to the fractional constraint (REF b) and the non-convex constraints (REF b) and (REF c).
Noting that problem (REF ) has a similar form as the max-min-ratio fractional programming problems [1]}, Dinkelbach's transform can be applied to convert it into a more tractable form [2]}.
Specifically, the fractional constraint (REF b) can be converted into a polynomial expression (REF ) as shown on the top of this page
<FIGURE>