I am running a MIP problem. I am using a set of inputs and the code converges and I get 27 feasible solutions (which are optimal matches) that would reduce the objective function, although I was expecting more, based on heuristics approaches. I test the other solutions by inputting smaller subset, one by one referring to these unidentified solutions (matches), and the code is able to identify those solutions (matches) when I do so. I am confused, why is the code not identifying these matches that reduce the total cost without affecting the other identified matches. It seems that the code is getting stuck at a local optima. I am setting presolve =0 because it was causing errors before. How do I debug the code? and solve this issue with the model?
Please sign in to leave a comment.