|Subject:||Re: [Help-glpk] Solution Ranking|
|Date:||Wed, 25 May 2011 20:39:00 -0500|
I guess the answer is no:
That's disappointing. The suggestion is to add a constraint to make the optimal solution infeasible and run it again. I'm afraid that is too inefficient for my application. Imagine it had generated half the search tree and then you have to throw that away and start over. Bummer.
The main GLPK page says I should use this list to request an enhancement. Please consider this a request.
I will look into using Symphony:
Any other suggestions?
On May 25, 2011, at 3:39 PM, address@hidden wrote:
With GLPK, can I get a list of the top, say, 10 or 20, optimal solutions, instead of only the one optimal solution, without having to re-run the solver over again? How would I do that?
|[Prev in Thread]||Current Thread||[Next in Thread]|