OK let me draw pon some maths. There are 2 equations a+b+c+d=7.2 and a.b.c.d = 7.2. So simultaneous equations will not work and a brut force method must be used. The solution, if it exists, is a continuous set, ie like all points in a volume are continuous with each other. Now to find a solution take a point from one end of the 4d space say -1000,-1000,-1000,-1000 and another point -0.1,-1000,-1000,-1000 and see which is closer to 7.2
Let nuff = 1 and little = 0
So a sample of nuff, nuff, nuff, nuff = 1111
Do other samples like
1111
1110
1101
1100
...
0000
See which sample aproaches 7.2.
Then continue the process of brut force searching using the two closest points found so far as the new nuff and little limits. As you may have noticed, this optimised the search using a binary-like search. I did not do this implementation and I also assumed that there was some order, like greatest to smallest, in the product & sum of all points, thus a binary-like search could be used. The order is more likely wavy, ie high to low to high, so this method could fail to find existing solutions, and I an not comfortable with that part.
Do you think this approach could work?
Let's act on what we agree on now, and argue later on what we don't.
Black men leave Barbeque alone if Barbeque don't trouble you