I have a binary variable $X_{ijk}$ which I have defined as the following :
X_ijk = [LpVariable("X{0}{1}{2}".format(i+1, j+1, k+1), cat="Binary")
for i in range(N1) for j in range(N2) for k in range (N3)]
I am struggling to code the following objective function
$$\min \quad \left[\sum_{k=1}^{k=N_3} C^k \left(\sum_{i=1}^{i=N_1}\sum_{j=1}^{j=N_2}P_{ij}^k \cdot X_{ijk}\right)\right]$$
where we know $C^k$ and $P_{ij}^k$. I have defined them as follows :
C_k = numpy.random.uniform(0,100,size=(N3))
P_ijk = numpy.random.uniform(0,100,size=(N1,N2,N3))
Assuming the following has been defined :
prob = LpProblem('Optimization Problem', LpMinimize)
How should I go about modeling the objective function?