[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 mgalati):

 Is Dippy using the MILPBlock app interface? Or is it interfacing directly?
 If with MILPBlock, do you have a block file? If directly, how do you
 determine what the relaxation is?

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