[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] shiftcover.mod - generate different solutions
From: |
Andrew Makhorin |
Subject: |
Re: [Help-glpk] shiftcover.mod - generate different solutions |
Date: |
Wed, 16 Feb 2011 18:55:26 +0300 |
On Wed, 2011-02-16 at 14:48 +0000, Andreas F wrote:
>
> I am looking at the 'shiftcover.mod' sample in the examples directory. I get
> the same solution every time I run it, which I suppose is expected.
>
> However, is it possible to generate multiple, different solutions, i.e.
> several distinct, alternative work schedules that are no necessarily
> mathematically optimal? The goal is to create more than one work schedule,
> and then let the workers themselves choose among them.
>
> $ glpsol -v
> GLPSOL: GLPK LP/MIP Solver, v4.43
>
Currently glpk does not have such a feature. However, you may obtain an
alternate mip solution by introducing a packing inequality to disable
the current optimal solution. See
http://lists.gnu.org/archive/html/help-glpk/2010-02/msg00033.html
for example.