[Help-glpk] Regarding speeding up MIPs by providing Initial solutions

[gaurav khanna]

Hi all,

>From what I understand by looking at the GLPK manuals, it does provide you
with the capability to specify a bound on the objective function value
which avoids extra branching. For my problem, I have formulated it as a
MIP optimization problem. Currently, it takes too long to solve it and I
have tried almost all relevant options. The other approach that I think
might work is to employ a heuristic to get a feasible solution and then feed the
entire solution to GLPK. THe heuristic I have currently is very fast so if
GLPK accepts an initial solution of the MIP and optimizes it furthur, one
would expect the runtime to go down.

Does GLPK let you accomplish this in some direct/indirect way?

Regards
Gaurav

Gaurav Khanna
Phd Student
CSE Department,OSU

Phone (office):614-292-7036