Change of solution without changing code

GAMS
1

Hi everyone,

The attached model determines a maximum power demand depending on velocities of cars. The quicker they drive, the longer must the distance be between them. The cars cannot exceed speed that would make the needed distance between cars larger than the overall track length.

I calculate the overall distance covered, dTot.

dTot =e= sum(c, dCar(c));

Letting the code run, dTot equals 69.136m and is therefore below the overall track length of 2000m.

dTot =l= lTrack;

However, if I change the track length to e.g. 200m, which still allows the previous solution, no solution at all is given. The optimum is suddenly zero, although I don’t change anything else! Any thoughts on that?

Bests,
supra
MaxPowerTrack.log (1.91 KB)

2

This is an NLP and perhaps a non-convex NLP with many local solution. You can try to run a global solver (Antigone, Baron, Couenne, Lindo, Scip) to find the global optimum. Don’t forget to set the optimality tolerance to 0: transport.optCR=0; If this doesn’t do it there must some logical issue and to help with this we would need to see more.

-Michael