[Dip-tickets] [Dip] #89: check on relaxation of convexity constraints after branching in PC

[Dip]

#89: check on relaxation of convexity constraints after branching in PC
--------------------+-------------------------------------------------------
Reporter:  mgalati  |     Owner:  mgalati
    Type:  defect   |    Status:  new    
Priority:  major    |   Version:  trunk  
Keywords:           |  
--------------------+-------------------------------------------------------
 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.

-- 
Ticket URL: <https://projects.coin-or.org/Dip/ticket/89>
Dip <https://projects.coin-or.org/Dip>
An extensible software framework for implementing decompositon-based bounding algorithms for use in solving large-scale discrete optimization problems.