Some test design problems can be seen as combina torial optimization problems. Several suggestions are presented, with various possible applications. Results obtained thus far are promising; the methods suggested can also be used with highly structured test specifica tions.
Get full access to this article
View all access options for this article.
References
1.
Boomsma, Y. (1986). Item selection by mathematical programming. Master's thesis, Twente University of Technology.
2.
Dantzig, G. (1957). Discrete-variable extremum problems. Operations Research, 5, 266-277.
3.
Lord, F.M. (1980). Applications of item response theory to practical testing problems. Hillsdale NJ: Lawrence Erlbaum.
Taha, H.A. (1975). Integer programming. New York : Academic Press.
10.
Theunissen, T.J.J.M. (1985). Binary programming and test design. Psychometrika, 50, 411-420.
11.
Theunissen, T.J.J.M., & Verstralen, H.H.F.M. (1986). Algorithmen voor het samenstellen van toetsen [Algorithms for test design]. In W. J. van der Linden (Ed.), Moderne methoden van toetsconstructie en -gebruik. Lisse, the Netherlands: Swets & Zeitlinger.
12.
Timminga, E. (1985). Geautomatiseerd toetsontwerp: Itemselectie met behulp van binair programmeren [Automated test design: Item selection by binary programming]. Master's thesis, Twente University of Technology .
