Hi,
You should not be looking at AOA or GMP-AOA for you non-convex model. Very likely AOA will only find a local optimum solution.
Instead, you should linearize these terms:
sum[(k),sum[(t),E(k,t)*(1-Z(k,k,t-1))*Z(k,k,t)]]
where Z is a binary variable. Then you end up with a linear MIP problem which is easier to solve and for which you can get a global optimum solution.
Basically, if you have a product x_i * x_j where x_i and x_j are binary variables then you can replace this product by a new variable y_ij after adding new constraints
y_ij <= x_i
y_ij <= x_j
x_i + x_j - y_ij <= 1
y_ij >= 0
This will enforce y_ij to be 1 if both x_i and x_j are 1, and y_ij is 0 otherwise.
Best regards,
Marcel Hunting
AIMMS Software Developer