Hello

I am finding difficulty in modeling this constrain, your help would be much appreciated:

s(j+n) >= c(i,j) for every i where n= 1,2,3,4,5…N-j

s(j) is a defined parameter

c(i,j) is a defined variable

i and j are defined sets

N is equal to last component of set j

how can I index j+n and how to create n= 1 to N-j (dynamically changing with j)

Note that this is an equation (we cannot use loops), i have nonetheless tried to use loops but it won’t allow me to include n a non primary number. I have also tried circular loops s(j++1) but i am trying to compare cij to all following sj starting from s(j+1) till the end of set j.

Thank you for your help! The file is attached below.

fyp.gms (2.83 KB)