Global consistency of constraints in a MIP program

46 Views Asked by At

How does a Mixed Integer Programming (MIP) solver ensure global consistency of constraints while adding an additional constraint (during branch and bound). A naive method would be to add the additional constraint and then compute a feasible solution (if possible). Are there smarter techniques of only adding additional constraints which have no conflict(s)?