[Dip] Dippy says problem is infeasible

[Romain Montagné]

Hello DIP community,

I am using Dippy to solve a MILP. I want to compare  branch-and-bound and branch-and-price performances. 

When I solve the problem with branch-and-bound (i.e., with the option ‘doPriceCut’ set to 0), it works great. But when I activate the  ‘doPriceCut’ option for branch-and-price, it tells me the problem is infeasible. 

Does anyone know what is happening? 

I have looked at the .lp file as well as the block file and they look ok.

Any help is greatly appreciated.

Cheers,

Romain Montagné, PhD 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/dip/attachments/20170209/e1caa6ed/attachment.html>