[Dip-tickets] [Dip] #47: Problem with bounds on variables at the root node.

[Dip]

#47: Problem with bounds on variables at the root node.
--------------------+-------------------------------------------------------
Reporter:  kmartin  |       Type:  defect
  Status:  new      |   Priority:  minor 
 Version:  trunk    |   Keywords:        
--------------------+-------------------------------------------------------
 The behavior described below can be tested using the osDip example where
 the osdip.parm test problem is


 #first simple plant location problem
 OSiLFile = osilFiles/spl1.osil
 #setup constraints as blocks
 OSoLFile = osolFiles/spl1.osol

 For this problem the root node, before branch and bound

 PRICE_AND_CUT_masterProb.n0.c0.p0.lp

 has huge bounds on the variables such as those given below


 ub(x(15)):  - sBL(c_10_ub(x(15))) + lam(c_22,b_0) >=
 -179769313486231570814527423731704356798070567525844996598917476803157260780028538760589558632766878171540458953514382464234321326889464182768467546703537516986049910576551282076245490090389328944075868508455133942304583236903222948165808559332123348274797826204144723168738177180919299881250404026184124858368

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