Find the Best Optimization Method for Creating Test Groups - Mike

MJNun
Messages
2
Reaction score
0
I am looking for a term to describe a sort of "optimization" that I am trying to do.

Hi everybody, I am a college student who unfortunately is not smart enough to be a math major. But nonetheless I am obsessed with statistics and numbers. I have a question:

I need help figuring out a term, or a statistical method to describe and help me solve what I am looking to do.

I will give you the layout of my project (it is not real, just a good way of explaining what i am trying to accomplish):

I gave 40 students a test on Day 1, (test 1, 2, 3, or 4). At random, I gave them either test 1,2,3,4,5 or No test (0) on Day 2. But made sure not to repeat tests so a student cannot take test 2 on both days. I have averaged their scores and listed which students received which tests in my attachment so you can have a visual representation.

What I am trying to do, and what I would like some help on is:
Creating 4 groups of 4 students who only have one test in common
Group 1: (1,0), (2,1), (4,1), (1,5)
Group 2: (2,4), (2,1)*Different person than group 1, (3,2), (2,0)
ect.

But here is where I have trouble (even explaining), I want to make it so that each group is optimized in way that the groups have the highest possible score, while keeping the standard deviation of the groups at a minimum.

So basically is there a term, or analysis method that would help me figure out what I am trying to do. I figured there has to be a way to weight the standard deviation, so that I have the most equal groups possible, while still having the highest scores.

Think of it as if I were assembling a team for a competition, and I wanted to make each group as strong as possible for a single test (the one they have in common), while also making sure they had diversity in their knowledge. This is where I get optimization from, I am trying to optimize my team.

Does this make sense? If not please don't just ignore this, feel free to ask me a question if you are confused, and any help at all will be much appreciated.

- Mike
 

Attachments

  • sample for physics forum.png
    sample for physics forum.png
    19.8 KB · Views: 575
Physics news on Phys.org


Just to clarify, I plan on doing this with up to 17 different tests and 200+ students. So this is a simplified version of my goal.

Also, I plan on asking someone who is good with Matlab to write me a code. So if someone could explain to me a statistical analysis method that describes this crazy 'optimization' problem in words that would help me ask a more direct request to someone with Matlab expertise that would be great. Or any of you think you can tackle this with Matlab, that would be incredible.
*A friend of mine said that I might be looking for something that involves Mean Square Error (but he's not a math major either)*
 


Hello MJNun and welcome to the forums.

It's quite a challenge you've set for yourself, and the specific choices of the objectives and constraints are going to be crucial to whether this combinatorial optimisation problem is merely difficult to solve or near impossible.

If math isn't your strong point, then perhaps you can describe more about the actual purpose of the teams?

Otherwise I'd suggest speaking to an expert in Operations Research (particularly in quadratic binary integer programming) who can help to formulate and solve the problem (not necessarily using Matlab).
 


MJNun said:
I want to make it so that each group is optimized in way that the groups have the highest possible score, while keeping the standard deviation of the groups at a minimum.
When you say standard deviation, do you mean for each individual student across their own test results? (i.e. they will be preferred if they scored quite strongly across all tests, rather than just acing one or two?) ... or the students' totals within the group (i.e. all members in a given group should be of a similar overall standard?)

Also, what is the idea behind giving some students no test on day 2? I feel like this is a missed opportunity to gather useful data.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top