|
From: | Salim Fadhley |
Subject: | [Help-glpk] Re: Counting solutions rather than optimizing solutions |
Date: | Sun, 25 Feb 2007 00:30:34 +0000 |
User-agent: | Thunderbird 1.5.0.9 (X11/20070103) |
If the variables are continuous, there exist infinitely many feasible solutions. Or do you mean only basic solutions?
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.
[Prev in Thread] | Current Thread | [Next in Thread] |