Forum Discussion
FICO
3 years agoCommunity Manager
Lazy constraints on LP problems
Dear all, I have an LP problem (no integer constraints) where a large number of constraints can in most cases be avoided in most cases just as for Lazy Constraints. However, lazy constraints seem ...
FICO
3 years agoCommunity Manager
You can force Xpress to solve a problem as MIP by calling XPRSmipoptimize (or the equivalent function in the programming API you are using).
This should then handle the delayed rows as expected.
Indeed for LPs, the "delayed" flag is ignored on rows an delayed rows are treated as regular rows.
Related Content
Related Content
Implementing Lazy Constraints (C++)
I'm implementing a B&Cut algorithm with BCL - C++ using the cut manager callback. Also I have to implement Lazy Constraints, that is, after each integer solution, search the violated constraints and...9 years agoPlace FICO® Xpress Optimization ForumFICO® Xpress Optimization Forum5 unread comments5 unread0Views0likes5CommentsImplementing 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...10 years agoPlace FICO® Xpress Optimization ForumFICO® Xpress Optimization Forum6 unread comments6 unread0Views0likes6CommentsLazy cut callback in Java
In Java, how can one separate cuts in a lazy manner, i.e. only separate cuts at the integer nodes? Such an approach is common in for instance a standard TSP formulation where the subtour elimination ...5 years agoPlace FICO® Xpress Optimization ForumFICO® Xpress Optimization Forum8 unread comments8 unread1View0likes8Comments