Java program to find maximum achievable value with a knapsack of weight W and multiple instances allowed .
public class UboundedKnapsack { private static int max ( int i , int j ) { return ( i > j ) ? i : j ; }