11 #include "OsiCuts.hpp"
24 OsiColCut *infeascut =
new OsiColCut;
32 infeascut -> setLbs (1, &i, &lower);
33 infeascut -> setUbs (1, &i, &upper);
35 cs.insert (infeascut);
47 if (cs.sizeColCuts () == 0)
52 lbs = cs.colCutPtr (cs.sizeColCuts () - 1) -> lbs (),
53 ubs = cs.colCutPtr (cs.sizeColCuts () - 1) -> ubs ();
55 return ((lbs.getNumElements () == 1) &&
56 (ubs.getNumElements () == 1) &&
57 (*(lbs.getIndices ()) == 0) &&
58 (*(lbs.getElements ()) == 1.) &&
59 (*(ubs.getIndices ()) == 0) &&
60 (*(ubs.getElements ()) == -1.));
bool isWiped(OsiCuts &cs)
Check whether the previous cut generators have added an infeasible cut.
void WipeMakeInfeas(OsiCuts &cs)
Add a fictitious cut 1<= x_0 <= -1 as a signal to the node solver that this node is deemed infeasible...