Perhaps what is meant is "maximize the difference between the optimal result and the one calculated by the naive greedy algorithm".

Thanks for clarifying my poorly worded description, that’s exactly what I meant. Like in the example given, the difference is 10-4=6, let’s call this the naive_greedy_miss_factor. Can we choose three other denominations so that NGMF is > 6?