> The solutions represent coins, so they have to be real numbers. I did > get a very good dynamic programming solution to this puzzle (before I > asked the question), however I was just curious to see if I could come > up with a better solution using glpk.
The issue is unclear. Counting the number of integer feasible solutions (as well as generating them) for your problem is a trivial task. Since the problem has no objective, what does "a better solution" mean? _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
