<div dir="ltr"><div><div>Dear all<br><br>I have <br></div>min cx<br></div>a1x<= b1<br><div>a2x<= b2<br>a3x<= b3<br><br>min cx<br>a1x<= b1<br></div><div> remains in master problem<br><br>a2x<= b2<br>moves into subproblem and <br>
<br>a3x<= b3<br></div><div>are separated in generateCut function.<br><br></div><div>Everything is fine in the generteCut(), the violated cuts are added, DIP DOES receive the new cuts but the cuts do not have any effect.<br>
</div><div>The reported optimal solution is infeasible as those a3x<= b3 are not taken into account.<br><br><br></div><div>As an example a3x<= b3 can be considered as SEC constraints. They are not for improve polyhedral description but are for cutting integer solutions.<br>
</div><div><br></div><div><br></div><div>I appreciate comments.<br><br>regards<br>Shahin<br></div><div><br></div><div><br><br><br><br></div><div><br></div></div>