Knapsack problem/Continuous: Difference between revisions

{{task|Classic CS problems and programs}}

 

 

A robber burgles a butcher's shop, where he can select from some items. He knows the weights and prices of each items. Because he has a knapsack with 15 kg maximal capacity, he wants to select the items such that he would have his profit maximized. He may cut the items; the item has a reduced price after cutting that is proportional to the original price by the ratio of masses. That means: half of an item has half the price of the original.

=={{header|Ursala}}==

We might as well leave this one to the experts by setting it up as a

[http://www.gnu.org/software/glpk/glpk.html glpk] depending on the

[http://www.basis.uklinux.net/avram run-time system] configuration).