Cuts for MILP infeasible subproblem #37
Description
Currently, if there is a problem where there are MILP subproblems (second stage or beyond) and one of the subproblems is infeasible, the feasibility cut for this problem is generated from the LP relaxation (it is possible that the LP relaxation is feasible, and therefore this returns an optimality cut). If the MILP problem is infeasible, we could instead add a logic-based cut that removes that integer solution as an option. This could be worth implementing in the future to make this situation more robust.