How to formulate this problem in cvx


(mohamed) #1

I am trying to simulate a paper . Please have a look to the problem (13) in the paper.
http://www.sce.carleton.ca/faculty/yanikomeroglu/Pub/ICC2016-ibyaekhy.pdf.

Is the following formulation correct?

x_max=3000;
y_max=3000;
h_min=100;
h_max=1000;
M1 = 1e4;
M2 = 1e4;

cvx_begin quiet
cvx_precision medium
cvx_solver mosek

variable U(1,NUM_USER) binary; %users
variable xd;
variable yd;
variable h
variable R;
expression d(NUM_USER,1);
expression th(NUM_USER,1);
expression rmin(NUM_USER,1);

maximize sum(U)
subject to
for i = 1:NUM_USER
d(i,1)=R^2;
th(i,1) = Gamma(i)+(M1*(1-U(i)));
d(i,1) <= th(i,1);

rmin(i) = norm([ (Uloc(i,1) - xd); (Uloc(i,2) - yd)]) - (M2* (1-U(i)));
R >= rmin(i);

end
xd^2 <= x_max;
yd^2 <= y_max;
h >= h_min;
h <= h_max;
R >= 0;
cvx_end