[Bcp-tickets] [Branch-Cut-Price Framework] #11: bound checking in test_full()

[Branch-Cut-Price Framework]

#11: bound checking in test_full()
------------------------+---------------------------------------------------
 Reporter:  fmargot     |       Owner:  somebody
     Type:  defect      |      Status:  new     
 Priority:  major       |   Milestone:          
Component:  component1  |     Version:          
 Keywords:              |  
------------------------+---------------------------------------------------
 The tests in BCP_lp_user::test_full() (similar tests in test_binary() and
 test_integer())

    if (val < vari->lb() - etol || val > vari->ub() + etol)
      return(NULL);

 might make test_full() return "infeasible" for a solution where all
 integer variables are indeed integer (with precision etol), but a
 continuous variable is slightly below its lower bound. Then BCP will fail,
 as no branching variable can be found.

 I would use this test only for integer variables.

-- 
Ticket URL: <https://projects.coin-or.org/Bcp/ticket/11>
Branch-Cut-Price Framework <http://projects.coin-or.org/Bcp>
A parallel framework for branch-cut-price algorithms.