private int calcBiggestFeasible (int currentQuantity, Set<Integer> productPackCapacitySet) {
		int bf = 0;

		int i;

		for (i = currentQuantity; i >= 1; i--) {
			if (productPackCapacitySet.contains(i)) {
				bf = i;
				return bf;
			}
		}
		return bf;
	}