Algorithms for Computerized Test Construction Using Classical Item Parameters
- 1 September 1989
- journal article
- Published by American Educational Research Association (AERA) in Journal of Educational Statistics
- Vol. 14 (3) , 279-290
- https://doi.org/10.3102/10769986014003279
Abstract
Recently, linear programming models for test construction were developed. These models were based on the information function from item response theory. In this paper another approach is followed. Two 0-1 linear programming models for the construction of tests using classical item and test parameters are given. These models are useful, for instance, when classical test theory has to serve as an interface between an IRT-based item banking system and a test constructor not familiar with the underlying theory.Keywords
This publication has 10 references indexed in Scilit:
- Binary Programming and Test DesignPsychometrika, 1985
- Computational Aspects of the Greatest Lower Bound to the Reliability and Constrained Minimum Trace Factor AnalysisPsychometrika, 1981
- Lower Bounds for the Reliability of the Total Score on a Test Composed of Non-Homogeneous Items: I: Algebraic Lower BoundsPsychometrika, 1977
- A Generalization of Coefficient AlphaPsychometrika, 1977
- THE RELATION OF ITEM DISCRIMINATION TO TEST RELIABILITY1Journal of Educational Measurement, 1967
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960
- Discrete-Variable Extremum ProblemsOperations Research, 1957
- Theory of mental tests.Published by American Psychological Association (APA) ,1950
- A Basis for Analyzing Test-Retest ReliabilityPsychometrika, 1945