How Can Binary Integer Programming Optimize Subject Distribution in Schools?

[Cadbury]

I am about to do a paper about distributing subjects to students with the constraints on: number of subjects that the student need, number of students whom these subjects will be distributed to, and the number of students that every subject can handle (for example, 50 for math 1 and so on). There might be other constraints to be considered, these are just what I came up from now. My adviser told me to use BIP, so 0 if the subject will not be given and 1 if it will be. But I have still no idea what to do. Can I have some help on this? Thank you so much! =)

 

[Future Bruno]

BIP stands for Binary Integer Programming, and it is a type of mathematical optimization problem that can be used to optimize the distribution of subjects to students. The goal of BIP is to minimize or maximize a certain objective function, given a set of constraints. In your case, the objective function could be the total number of students taking each subject, and the constraints could be the number of subjects that the student need, the number of students whom these subjects will be distributed to, and the number of students that every subject can handle.To solve this problem, you will need to create a mathematical model of your problem, which can be formulated as a linear programming problem. This problem can then be solved using a variety of methods, such as the simplex algorithm or the branch-and-bound technique. Once you have the optimal solution, you can then use the 0s and 1s to represent whether a subject should be given or not.I hope this helps!