[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [Help-glpk] Solution Ranking

**From**: |
Michael Hennebry |

**Subject**: |
Re: [Help-glpk] Solution Ranking |

**Date**: |
Thu, 26 May 2011 15:51:56 -0500 (CDT) |

**User-agent**: |
Alpine 1.00 (DEB 882 2007-12-20) |

On Thu, 26 May 2011, Lou Hafer wrote:

If you don't already know the optimal objective, the problem becomes
one of collecting solutions and regularly purging the collection as
better solutions are discovered. Back in the solver, the run time mounts
because you cannot do effective pruning by bound in the search tree. You
can discover hundreds of solutions, only to discard them all when the
search reaches an area of the tree with better objective value.

Good point.
Perhaps instead of lying about feasibility,
one could lie about the objective value.
If it can't be done directly,
perhaps one could sock the solution away and
inject it as a heuristic solution later.
--
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."