Hello,

I’m trying to generate a sports league schedule with GAMS. I want to minimise the distance travelled on certain match days (for example in winter) while also limiting the carry-over effect given from one team to another.

My problem is that my minimisation only returns a result if the solution is 0, otherwise it says the problem is integer infeasible. I don’t understand why my model requires the solution of 0 for “dis”. The way it is written, I thought it would model the pairings i,j with the lowest distance for k<3 and pairings with larger distance for k>=3 and then return a solution that is greater than 0.

If I modify the data in the table with to more 0s, so that all pairings with k<3 can be made with a distance of 0, the problem is solved and returns a usable schedule.

What can I change so it allows a solution greater than 0?

League-Schedule.gms (2.35 KB)