Re: [Help-glpk] Solution Ranking

[Michael Hennebry]

On Wed, 25 May 2011, Terry wrote:

> I guess the answer is no:
> http://en.wikibooks.org/wiki/GLPK/Modeling_tips#All_optimal_solutions
>
> 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.

You could add a hook to the feasibility tester.
Tell GLPK that all solutions are infeasible,
but collect the ones that are optimal.

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

--
Michael   address@hidden
"Pessimist: The glass is half empty.
Optimist:   The glass is half full.
Engineer:   The glass is twice as big as it needs to be."