Optimum allocation of places to students in a national university system
- 28 Downloads
In several countries, the allocation of university places to students is handled by a Central Applications Office at a national level. An algorithm based upon a constrained form of the well-known Stable Marriage Problem is presented for optimum assignment of places to students in the sense that their actual entry standards and the sum of their preferences for the courses assigned are optimised subject to the constraints imposed by the minimum entry standards and the number of places available. A method for the reduction of the size of large problems is also given.
KeywordsComputational Mathematic National Level Optimum Allocation Large Problem Optimum Assignment
Unable to display preview. Download preview PDF.
- 1.D. I. Fleming,A student allocation system, M.Sc Thesis, Trinity College Dublin, 1982.Google Scholar
- 2.D. Gale and L. S. Shapley,College admissions and the stability of marriage, Amer. Math. Monthly, 69 (1962), 9–15.Google Scholar
- 3.D. G. McVitie and L. B. Wilson,Stable marriage assignment for unequal sets, BIT, 10 (1970), 295–309.Google Scholar
- 4.D. G. McVitie and L. B. Wilson,The application of the stable marriage assignment to university admissions, Opl. Res. Q., 21 (1970), 425–433.Google Scholar
- 5.D. G. McVitie and L. B. Wilson,The stable marriage problem, CACM, 14 (1971), 486–492.Google Scholar
- 6.L. G. Proll,A simple method of assigning projects to students, Opl. Res. Q., 23 (1972), 195–201.Google Scholar