Originally posted by: chicho12188

Hello, this is the first time im postin in this forum and i hope you could help me out with a problem i'm having.

On my model one of the restrictions is making my model to take really long to solve.

the restriccion is:
forall(p in pro, p2 in pro, l in lin, t in per, t2 in per: t2>=t)(L[p][l][t]+Lp2[l]t2-1)*AL[p]p2<=sum(k in t+1..t2)Y[l][k];

"L" and "Y"are binary variables

could some one tell how could i write this in another way in order that it does not search for every t an t2, but only for the ones that i want to?

i would like it to use only "t2" for the case where sum(k in t..t2, p3 in pro)Lp3[l][k]==0

Thank you!
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

In order to make your code readable, you need to put {code} before and after it.

Paul

Mathematicians are like Frenchmen: whenever you say something to them, they translate it into their own language, and at once it is something entirely different. (Goethe)
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: chicho12188

Paul, or anyone that would like to help me, atached im sending the files of my model (.mod, .dat and the excel file from which i extract my data), hopefully you can help me to get results with it.
As i mention on the excel, the data in this case is just an example, because if i would put all the data that really exists, the problem does not even presolve before i get out of memory issues.

Thank you!

Pablo
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: SystemAdmin

Just a very wild guess: Does it speed up things if you rewrite

forall(p in pro, p2 in pro, l in lin, t in per, t2 in per: t2>=t)

as

forall(t in per, t2 in per: t2 >= t) forall(p in pro, p2 in pro)

#CPLEXOptimizers
#DecisionOptimization