[Dip-tickets] [Dip] #24: doPriceCut gives infeasible when doCut and doRelaxCut solve

[Dip]

#24: doPriceCut gives infeasible when doCut and doRelaxCut solve
--------------------+-------------------------------------------------------
Reporter:  mosu001  |       Type:  defect
  Status:  new      |   Priority:  major 
 Version:  0.8.7    |   Keywords:        
--------------------+-------------------------------------------------------

Comment(by mosu001):

 The same problem also has an issue with producing infeasibility using
 doRelaxCut and moving constraints into relaxations. Please note that this
 is with version 0.8.6 not 0.8.7, I can generate the appropriate LP files
 if necessary.

-- 
Ticket URL: <https://projects.coin-or.org/Dip/ticket/24#comment:1>
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.