Mario Ruthmair

If all the different parameter settings lead to status "infeasible" then probably the model is indeed infeasible. Yes, computing an IIS can sometimes take a long time but I would consider this as a...

Hi, There seem to be some numerical issues in your model related to finite precision arithmetics.Here are some guidelines for numerical issues, where also the relation to presolve is detailed. Here...

Hi, No, unfortunately there is no way to access intermediate simplex solutions during a callback. In the SIMPLEX callback you can only retrieve current objective value, iteration, and infeasibiliti...

Hi, Only because some objective function "looks" easier than another one does not mean that it is easier to solve. For the first objective, the dual bound obtained by the root relaxation is already...

I probably was not clear with my last comment. The idea is not to add further constraints to ensure that binary variables get exactly value 0 or 1. This is simply not possible on all our machines w...

Yes, things like this still can happen due to limited precision arithmetics. We usually do a very rough test for binary variables in a solution: if x > 0.5 then x=1 else x=0.

Since your x[2] variable is integer, you do not need the eps value in the first constraint, it might even lead to numerical issues (or forbid x[2] == 3 in some cases).

Hi Tino, The exception you got comes from CPLEX, not Gurobi.So, if you moved from CPLEX to Gurobi there might be still some CPLEX parts left? Best regards,Mario

Hi Ruben, We will handle this in a support ticket. Best regards,Mario

If you want have more control over the termination, you could use the MIPSOL callback to check and count solutions, and the current MIP gap, and then call abort() to cancel the process.