Re: using interior method with branch and cut

On Mon, 2024-11-11 at 19:45 +0000, Misha Aizatulin wrote:
> > Using the interior-point method to solve LP relaxations of the node
> > subproblems in B&B/B&C is not practical for many reasons, e.g., IP
> > is
> > unable to easily restart the search from the optimal solution of the
> > parent subproblem (which is dual feasible to the current one).
> > 
> > Glpk MIP solver doesn't provide such a feature.
> 
>    Got it. Perhaps to step back, the reason I'm asking is that with
> some problems I get solutions 
> that are not actually feasible, sometimes by a considerable amount. Is
> that surprising, and what 
> could I do about it?
> 
> 

please provide an example