[Dip-tickets] [Dip] #63: False "Problem infeasible"

[Dip]

#63: False "Problem infeasible"
---------------------+------------------------------------------------------
  Reporter:  vejlin  |      Owner:       
      Type:  defect  |     Status:  new  
  Priority:  major   |    Version:  trunk
Resolution:          |   Keywords:       
---------------------+------------------------------------------------------

Comment (by vejlin):

 The block file puts the 10 embedded disjoint knapsack problems in separate
 blocks.

 The error can be circumvented by artificially bounding all columns in the
 parameter file:
 ColumnLB = -1.0e4
 ColumnUB = 1.0e4

 This is not related to the issue with artificial bounds being needed for
 unbounded pricing problems, since these knapsack problems are all bounded.

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