this is my first stack post so five me for any social transgressions!
I have an optimisation(?) issue that begins incredibly simply but has a conditions that throws the whole thing into a realm of mathematics I can't begin to understand. I am/was trying to solve this in R with my very limited familiarity, but I don't actually know if there are the appropriate libraries for it, so I think I might need to finally go ahead and learn python for this. I am by no means looking for a solution, more guidance on what to read up and where to get started.
The issue is thus:
We have 20 brackets (i.e. Tables):
Each table has the following format - using this fake table Bracket 1 as representative.
Only rules here are that:
Test Value must be unique in the current bracket. E.g. Table 1 can have no duplicate Tests, but the same test can exist in a different bracket
The Bracket value must be the same for all in each table as it defines the name of the table.
The weight is per Name, not per test.
The value of a person's assigned weight can be between .1 and 1
The actual number of names included (and their tests) can vary from around 15 to 90.
Any person can have any number of tests
Bracket 1
Name | Test | Score | Weight | Bracket | Is multi bracket | Other brackets | Selected Test | Weight not counted | Tests not counted |
---|---|---|---|---|---|---|---|---|---|
Alice | Test 1 | 6 | 1 | 1 | N | ||||
Alice | Test 2 | 2 | 1 | 1 | N | ||||
Alice | Test 3 | 10 | 1 | 1 | N | ||||
Bob | Test 4 | 8 | 1 | 1 | N | ||||
Bob | Test 5 | 9 | 1 | 1 | N | ||||
Bob | Test 6 | 12 | 1 | 1 | N | ||||
Bob | Test 7 | 5 | 1 | 1 | N | ||||
Daniel | Test 8 | 12 | 1 | 1 | Y | 3 | |||
Daniel | Test 9 | 11 | 1 | 1 | Y | 3 |