Hello,

I am trying to solve an optimization problem, it seems it is convex, However, the CVX gives not feasible answer. I do not know where is the problem.

cvx_begin quiet

variables t r(7,1) c(7,1) z

maximize (z)

subject to

for iGroup = 1:nGroups

c(iGroup)+r(iGroup,1)>=z;

for iUser=1:2*NoUserperGroup
1-sum(c(1:7,1))>=(1-t) a(iGroup,iUser)+tb(iGroup,iUser)+c-2*sqrt(1-t)

*d(iGroup,iUser;*

1-r(iGroup)>=e(iGroup,iUser)+tf(iGroup,iUser)-2*sqrt(t)*g(iGroup,iUser);

1-r(iGroup)>=e(iGroup,iUser)+t

end

end

t>=0;

t<=1;

for i=1:7

c(i,1)>=0;

r(i,1)>=0;

end

cvx_end

Thanks