Originally posted by: SystemAdmin

Hey all
I'm new here and pretty new to CPLEX programming and would appreciate some help.

I'm trying to model the following constraint:
Sum(j=1..n)Sum(k=t..t+Const) P[j][k]<=W[t], for all t=1..m.

the problem is that P is [n] by [m] so whenever k>t-Const, i'm out of range.

i figured i can seperate the constraints to several cases (K<t-Const, k=t-Const+1....k=t+Const).
however, since all values (n,m,Const) can change i need to keep it dynamic.

i'd appreciate any ideas.

Eran
#DecisionOptimization
#MathematicalProgramming-General

Originally posted by: SystemAdmin

Dear Eran,

what you would like to do is change the second sum from
Sum(k=t..t+Const)
to
Sum(k=t..min(t+Const,m))

That would do the job, right?

Regards
Norbert
#DecisionOptimization
#MathematicalProgramming-General