[Dip-tickets] [Dip] #66: False "Problem infeasible" (different from #63)

[Dip]

#66: False "Problem infeasible" (different from #63)
-------------------+--------------------------------------------------------
Reporter:  vejlin  |       Type:  defect
  Status:  new     |   Priority:  major 
 Version:  trunk   |   Keywords:        
-------------------+--------------------------------------------------------
 arki001 instance (from miplib) is falsely determined to be infeasible in
 the root node.

 to reproduce:
 1) use the MILPBlock example
 2) use the arki001 example from miplib (available with the MILP example)
 3) use arki001.block block file (attached)
 4) set artificial column bounds: ColumnLB = -1.0e4 ColumnUB = 1.0e4

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