Yuriy Zinchenko

> If Guroubi computes IIS using a filtering algorithm, that means we can attempt to get multiple IISes by shuffling the constraints in the model, correct? I tried doing that but Guroubi's computIIS...

Hello Dominique, 1. I believe the residual values are unscaled, and 2. the norm is simply the max (or \(\ell_{\infty}\)) norm. You can find a bit more info here, https://www.gurobi.com/documentatio...

Attacking this problem with brute force sounds awfully expensive.   Perhaps you can try to explore some hybrid approach where for continuous variables you can extract standard sensitive info instea...

You may also try to solve the LP with the barrier (method = 2) while switching the crossover phase off (crossover = 0).  The barrier algorithm will try to find a maximal cardinality solution, so if...

One more quick addition to the above, Daniel. It may also be the case that placing more emphasis on branching during the solve could be beneficial here. So, you may consider adding branchPriorities...

To manage how you prune a node from a branch and bound tree you would need to define your own callback that would add a locally "valid" cutting plane that would render the node infeasible.  For mor...

Hi Yuheng.  Thanks.  The log and the run looks normal, as the iterates converge.  Note since we solve an embedded model, which targets both feasibility and optimality at the same time, often the co...

Thanks, Yuhen.  The log and the run is normal.Note the we solve the embedded model, which simultaneously targets feasibility and optimality, so as long as the iterates seem to converge, things are ...

Hi Yuheng.  This is a massive model, from what it sounds!To make sure I do not miss something important, could you please paste a snapshot of the log here (say, the one printed to the console)?

Thank you for the feedback, Saska.  One thing I could potentially add is that right now we deliver a small IIS with high probability, due to the nature of how things are implemented. That is, if yo...