A Quick Problem
I remembered a toy problem I made up while solving a different (less of a toy?) problem and never followed up. Given n positive numbers (possibly fractions) and an integer k, find a way to group the numbers into k groups such that the sum over the groups of the product of numbers in each group is minimized. Does this map to a well-known problem?