We have the objective function to be minimized as
$$f_0(\textbf{x}) = \sum_{i=1}^{N} \frac{\textbf{a}_i^T \textbf{x}}{\textbf{x}^T \textbf{B}_i \textbf{x}}$$
where $\textbf{x}, \textbf{a}_i$ are same sized vectors and $\textbf{B}_i$ is positive semidefinite matrix. My The values in $\textbf{a}_i$ are all positive and $\textbf{x}$ takes positive values as well.
The constraint on $\textbf{x}$ is linear. I just dont know how to simplify the objective function so I can use some sort of algorithm or optimization method to optimize the equation.
As a follow up on my comment that the problem is nonconvex and most likely does not have any clever reformulation, here is an implementation using the MATLAB Toolbox YALMIP (disclaimer, developed by me) to solve the nonlinear problem using either a local solver or a global solver.
For efficiency, you should have an efficient LP solver installed (Gurobi, Mosek, SCIP, CPLEX, ...)
I found a bug when testing this problem, so you have to download the develop version of YALMIP on github if you want to run it.