Article ID: | iaor201526771 |
Volume: | 66 |
Issue: | 7 |
Start Page Number: | 1091 |
End Page Number: | 1100 |
Publication Date: | Jul 2015 |
Journal: | Journal of the Operational Research Society |
Authors: | Gill Andrew William |
Keywords: | combinatorial optimization, social, programming: mathematical |
Friendship groups are an important element in both the social and academic well‐being of school students, particularly in their younger years. Each year, school management has to assign students to a particular class in their new grade in junior school, and in doing so make and break friendship preferences as other criteria need to be satisfied in order to ensure diversity. This ongoing administrative task is time consuming and does not always result in the most equitable allocation. Coupled with the lack of transparency of the process, this can lead to teacher and parent frustration. This paper formulates and solves a mathematical programming model for this problem and shows that better solutions can likely be found in a fraction of the time using software that is freely available.