Re: [Help-glpk] MIP bounds for cutting

[Michael Hennebry]

On Tue, 26 Oct 2004, Joao Pedro Pedroso wrote:

> I am using the GLPK MIP solver in a situation where I know a primal
> feasible solution.  I would like to tell this solution's objective
> value to the solver, so that branch-and-bound may cut some extra
> branches.  Is there a way to do this?
>
> I believe that the branch-and-bound is doing it through the variable
>       double best;
>       /* incumbent objective value, that is the objective value which
>          corresponds to the best known integer feasible solution (it is
>          undefined if the flag found is not set); this value is a global
>          upper (minimization) or lower (maximization) bound for integer
>          optimal solution of the original problem being solved */
> in the structure MIPTREE; is it safe to change this variable directly?

Probably, but you can accomplish much the same thing by adding a constraint.

-- 
Mike   address@hidden
"Pilot, does Moya know where we are?"  --   Zhaan
"Yes, of course.  We're someplace else.
I'll get back to you on the specifics."  --  Pilot