check on relaxation of convexity constraints after branching in PC

coin-or / Dip

DIP is a decomposition-based solver framework for mixed integer linear programs.

https://github.com/coin-or/Dip/wiki

Eclipse Public License 1.0

17 stars 7 forks source link

check on relaxation of convexity constraints after branching in PC #89

Open svigerske opened 5 years ago

svigerske commented 5 years ago

Issue created by migration from Trac.

Original creator: @mgalati13

Original creation time: 2011-12-02 13:36:55

Assignee: @mgalati13

If 0 is feasible for a block b, we can relax the convexity con to <= 1 for that block. But, if after branching, 0 is no longer feasible, then <= 1 is wrong and we need to switch back to =1. Check if this is handled properly in DIP.