Recently, I’m coding and I meet the problem: Disciplined convex programming error: Cannot perform the operation: {real affine} ./ {real affine}

My code is shown as following, please help me to solve this problem

clear all;

close all;

clc;

Para = get_parameters();

K = Para.K;

U = Para.U;

N = Para.N;

D = Para.D;

C = Para.C;

P = Para.P;

cos = Para.cos;

alpha = Para.alpha;

h = Para.h;

t = Para.t;

B = Para.B;

L = Para.L;

N0 = Para.N0;

p_equal = [0.125 0.125;0.125 0.125;0.125 0.125;0.125 0.125];

[S,S_bar,rho] = two_sided_matching(Para,p_equal);

E_cmp = D*C.*P;

h_match = zeros(K,N);

flag = find(S~=0);

h_match(flag) = h(flag);

F = zeros(K,K,N);

for k = 1:K

for j = 1:K

for n = 1:N

if j == k

else

if h_match(j,n) < h_match(k,n)

F(k,j,n) = 1;

else

F(k,j,n) = 0;

end

end

end

end

end

cvx_begin

variable p(K,N);

expression p_bar(K,N);

expression I(K,N);

expression R(K,N);

obj = 0;

p_bar = p.*rho;
for k = 1:K
for n = 1:N
F_k = F(k,:,n);
I(k,n) = sum(F_k.*lg(1 + (p_bar(k,n)

*p_bar(:,n)’.*(h(:,n).^2)’); R(k,n) = B

*(h(k,n)^2)./(I(k,n)+N0)));*

end

end

obj = obj + sum(cos.(E_cmp+sum(p_bar,2).*t));

end

end

obj = obj + sum(cos.

minimize obj

subject to

sum(R,2)*t >= alpha.*L;

p >= 0;

cvx_end