Forum Discussion
Implementing Lazy Constraints (Java)
We are interested in using Lazy Constraints in Xpress (Java) to implement a TSP algorithm. In particular, after each integer solution is generated, we would like to search for violated constraints an...
It is not possible to define new constraints (XPRBctr) for a problem during the MIP search, instead you need to create cuts (XPRBcut) and add them to the problem via XPRBprob.addcuts.