The website http://rosettacode.org/wiki/Knapsack_Problem describes a fanciful trip by a traveler to Shangri La. They can take as many as they want of three valuable items, as long as they fit in a knapsack. The knapsack will hold no more than 25 weight units, and no more than 25 volume units. The problem is to maximize the value of the knapsack.Item I (panacea) weighs 0.3 units, has volume 2.5
To leave a comment for the author, please follow the link and comment on their blog: SAS and R.