Binary programming and test design
An algorithmic approach to test design, using information functions, is presented. The approach uses a special branch of linear programming, i.e. binary programming. In addition, results of some benchmark problems are presented. Within the same framework, it is also possible to formulate the problem of individualized testing.
Key wordslinear programming binary programming information function test-design individualized testing item bank
Unable to display preview. Download preview PDF.
- Birnhaum, A. (1968). Some latent trait models. In F. M. Lord & M. R. Novick (ed.),Statistical theories of mental test scores. Reading, MA: Addison-Wesley.Google Scholar
- Land, A. H., & A. Doig (1960). An automatic method of solving discrete programming problems.Econometrika, 28, 497–520.Google Scholar
- Lord, F. M. (1980).Applications of item response theory to practical testing problems. Hillsdale, NJ: Lawrence Erlbaum.Google Scholar
- Lord, F. M., & M. R. Novick (1968).Statistical theories of mental test scores. Reading, MA: Addison-Wesley.Google Scholar
- Oosterloo, S. (1984). Confidence intervals for test information and relative efficiency.Statistica Neelandica, 38, 37–54.Google Scholar
- Owen, R. J. (1975). A Bayesian sequential procedure for quantal response in the context of adaptive mental testing.Journal of the American Statistical Association, 70, 351–356.Google Scholar
- Papadimitriou, C. H., & K. Steiglitz (1982).Combinatorial optimization: Algorithms and complexity. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
- Rao, S. S. (1984).Optimization: Theory and applications (2nd ed.). New Delhi: Wiley Eastern.Google Scholar
- Syslo, M. J., N. Deo, & J. S. Kowalik (1983).Discrete optimization algorithms. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
- Taha, H. A. (1975).Integer programming. New York: Academic Press.Google Scholar
- Thissen, D., & L. Steinberg (1984). A response model for multiple choice items.Psychometrika, 49, 501–519.Google Scholar