M
mparish
Guest
This month we have a simple challenge problem: how can a given amount of money be made with the least number of coins of given denominations? Let S be a given sum that we want to achieve with a minimal amount of coins in denominations of x1, x2, …, xn. Here is a simple example: S is 123 cents, n is 4, x1 is 1 cent, x2 is 10 cents, x3 is 25 cents, and xn is 100 cents. Of course, you easily can solve this example without any tool (your children or grandchildren can do it too). You can find a formal problem definition and different solving techniques at http://en.wikipedia.org/wiki/Change-making_problem . A Corticon solution is attached. Other approaches to this are welcomed. You can also see how other vendors solved this problem here on the Decision Modeling Community website: https://dmcommunity.wordpress.com/challenge/challenge-feb-2015/ Corticon Rule Models available for download here: https://www.dropbox.com/s/e53ici4iv80o44e/Making%20Change%20-%20Greedy.zip?dl=0 https://www.dropbox.com/s/naj0vdam6181l37/Making%20Change%20-%20Tree.zip?dl=0
Continue reading...
Continue reading...