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
--
_______________________________________________
Help-glpk mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/help-glpk
