I run a Fantasy Motorcycle Racing league. As part of this players choose 2x Riders, and 1x manufacturer (the two data sets). You cannot choose the same rider twice, so therefore I'm looking at combinations without repetition. I have worked out that with the 28 riders, that would normally give you 378 possibilities, then with 5 manufacturers, I believe that would be 1890 total different combinations.
However, what I cannot work out how to create a formula for, is when each of the riders and manufacturers have a value assigned to them, and the combinations can only be valid when the total value does not exceed £xx.xx
My reason for wanting to achieve this is so that when I adjust rider or manufacturer values, I do not want to remove too many possible combinations,
Any help much appreciated!
Edit: To give Actual figures; Budget is 50, and remember 2x riders, 1 x manufacturer. You cannot choose a rider twice.
| Rider | Proposed Value |
|---|---|
| A | 20.1 |
| B | 16.6 |
| C | 8 |
| D | 18.1 |
| E | 17.2 |
| Manufacturer | Proposed Value |
|---|---|
| a | 17.5 |
| b | 16.6 |
| c | 16.1 |
| d | 11.3 |
| e | 10 |
eg: Riders A (20.1) + B (16.6) + Manufacturer d (11.3) = 48 (Accepted) Rider A (20.1) + Rider D (18.1) + Manufacturer c (16.1) = 54.3 (Not Acceptable)