Given a Fractional knapsack problem, the preferred way of solution strategy will be

The preferred strategy for solving a Fractional Knapsack problem is the Greedy Algorithm. Here are the steps:

1. Calculate the ratio (value/weight) for each item in the knapsack.

2. Sort all items by decreasing order of ratio.

3. Initialize the total value of the knapsack to be 0.

4. Take the item with the highest ratio and add them until we can't add the next item as a whole.

5. At the end of the items where we can't add the next item as whole, we add the next item as much as we can which is the remaining weight in the knapsack divided by weight of the item.

6. The total value of the knapsack is the sum of the values of items inside the knapsack.

This strategy ensures that we get the maximum possible value in the knapsack.