Read section 4.3.2 “Linear-fractional programming” of http://web.stanford.edu/~boyd/cvxbook/ .
Thank you but can’t i write directly as:
maximize G_0Tpow. * inv_pos(((G_0cTpow)+noise))
pow >= 0;
That would violate CVX’s rules. Hence, follow the approach in the link I provided.
I solved the problem using CVX by following the given link. Thank you.
Using linear transformation i wrote the code:
Where F is a square matrix and G_0T is row vector and G_0cT is also a row vector , B is a column vector, Pmax is a column vectoroutput of CVX is:
why this is so?
I am seeking for the help.
Why this is coming infeasible or inaccurate.