Is it possible to feed glpsol with a feasible initial solution to a MIP problem?

Alejandro Pascual <[email protected]>
Newsgroups gmane.comp.gnu.glpk
Message-ID <CANPvAP1fZgFLi=HYj=3RKtPU0S2PDfZ4QJPeUDq1TONe2UL0ug@mail.gmail.com> 
Hi,

I am working on a MIP problem for which glpsol can't find a feasible
solution in a reasonable amount of time. However, fixing the values of
the integer variables (which are all binary) to one, I can get glpsol
to find an optimum solution rather quickly. Is it possible to feed
this solution as initial (suboptimal) solution of the original
problem?

I have read in the help-list that this was not possible with MathProg
in 2007, but maybe now it is. If it is not, what would be the most
direct way to hack the code in order to do so?

Regards,
Alejandro Pascual
lmpx.com only provides a reader for public news (NNTP) servers. It is not affiliated with the servers or forums shown here and is not responsible for the content of articles, which is written by their respective authors.