[Coin-discuss] Setting Upper Bound in BCP

[Laszlo Ladanyi]

Hi Dan,

Feasibility in BCP is defined as 'there is a solution better than the initial
value fed to me'. So from that point of view BCP is correct. On the other hand
it'd be nice if it did report the that value (and if available, the solution
itself -- this might be possible in case you generate the heuristic solution,
not so easy to feed in a solution as input). I'll try to do something about
this when I'm back at IBM.

--Laci

On Tue, 6 Jun 2006, Dan Chen wrote:

> Hello Everyone,
>    
>   I find that when I set the upper bound with the optimal objective value in BB_init.cpp in BAC, the example of using BCP, the program will report infeasibility. 
>    
>     TM: search tree size: 3 max depth: 1
>   LP statistics:
>   time in cut generation : 0.000 sec
>   time in var generation : 0.000 sec
>   time in heuristics : 0.000 sec
>   time in solving LPs : 0.000 sec
>   time in strong branching: 0.004 sec
>   TM: No feasible solution is found
> 
>    
>   I also have this problem in my own project. If the heuristic find the optimal solution, the program will report infeasibility.
>    
>   P.S. The BB_init.cpp changed by me is attached.
>    
>   Best Regards!
>    
>   Dan Chen
> 
> 		
> ---------------------------------
> Now you can have a huge leap forward in email: get the new Yahoo! Mail.