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