Hi Stuart,
For non-convex MINLPs, the bound displayed by Knitro is not
valid. It gives an indication, but it might happen that a better integer
feasible solution exists.
In Knitro 14.1, which will be released in the next days, Knitro displays the bound only once it becomes confident enough that it is valid. On your problem, Knitro 14.1 with MIP multi-start will display:
Tree search
-----------
Nodes Best solution Best bound Gap Time
Expl | Unexpl value value (secs)
--------------- ------------- ---------- --- ------
1 2 5.48424 -inf 3.699
Knitro deduced that the problem is non-convex.
2 3 1.05830 FCRD -inf 4.142
12 5 1.05158 FCRD -inf 5.105
17 6 1.03222 FCRD -inf 5.173
50 13 0.813742 FCRD -inf 5.583
111 27 0.813742 FCRD -inf 6.169
1240 61 0.680949 FCRD -inf 15.647
Best,
Florian