[Help-glpk] MIP bounds for cutting

[Joao Pedro Pedroso]

Dear GLPK specialists,

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?

Thank you,

Pedro
--
Joao Pedro PEDROSO               address@hidden
Faculdade de Ciencias da Universidade do Porto
   Departamento de Ciencia de Computadores
R. Campo Alegre 823, 4150-180 Porto,  Portugal
Tel: (+351)226.078.830  Fax: (+351)226.003.654