[Help-glpk] MIP upper bound

[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?

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