Optimization of Classical Reliability in Test Construction

Journal of Educational and Behavioral Statistics

Volumn 23, Issue 1, 1998, Pages 1-17

  Armstrong, Ronald D ^b   Jones, Douglas H ^b   Wang, Zhaobo ^a  

^a FAIRLEIGH DICKINSON UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Classical test theory; Lagrangian relaxation; Network flows; Optimal reliability; Test design; Transshipment problem

Indexed keywords

EID: 0032350821     PISSN: 10769986     EISSN: None     Source Type: Journal    
DOI: 10.3102/10769986023001001     Document Type: Article

References (22)

1. Adema, J., & Van der Linden, W. J. (1989). Algorithms for computerized test construction using classical item parameters. Journal of Educational Statistics, 14, 279-290.
2. Ahuja, R. K., & Orlin, J. (1992). The scaling network simplex algorithm. Operations Research, 40, S5-S13.
3. Allen, M., & Yen, W. (1979). Introduction to measurement theory. Monterey, CA: Brooks/Cole.
4. Armstrong, R. D., & Jones, D. H. (1992). Polynomial algorithms for item matching. Applied Psychological Measurement, 16, 365-371.
5. Armstrong, R. D., Jones, D. H., & Wang, Z. (1993). Automated parallel test construction. Journal of Educational Statistics, 19, 73-90.
6. Armstrong, R., Jones, D., & Wu, I. (1992). An automated development of parallel tests from a seed test. Psychometrika, 57, 271-288.
7. Baker, F., Cohen, A., & Barmish, B. (1988). Item characteristics of tests constructed by linear programming. Applied Psychological Measurement, 12, 189-200.
8. Boekkooi-Timminga, E. (1987). Simultaneous test construction by zero-one programming. Methodika, 1, 101-112.
9. Boekkooi-Timminga, E. (1990a). A cluster-based method for construction. Applied Psychological Measurement, 14, 341-354.
10. Boekkooi-Timminga, E. (1990b). The construction of parallel tests from IRT-based item banks. Journal of Educational Statistics, 15, 129-145.
11. Cronbach, L. (1951). Coefficient alpha and the internal structure of tests. Psychometrika, 16, 297-334.
12. Ferguson, G., & Takane, Y. (1989). Statistical analysis in psychology and education. New York: McGraw-Hill.
13. Fisher, M. L. (1981). The Lagrangian relaxation method for solving integer programming problems. Management Sciences, 27(1), 1-18.
14. Fisher, M. L. (1985). An applications oriented guide to Lagrangian relaxation. Interface, 15, 10-21.
15. Garey, M., & Johnson, D. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman.
16. Kennington, J., & Wang, Z. (1992). Shortest augmenting path algorithm for the semiassignment problem. Operations Research, 40, 178-187.
17. Lord, F., & Novick, M. (1968). Statistical theories of mental test scores. Reading, MA: Addison-Wesley.
18. Nemhauser, G., & Wolsey, L. (1988). Integer and combinatorial optimization. New York: Wiley.
19. Shapiro, J. (1979). A survey of Lagrangian techniques for discrete optimization. Annals of Discrete Mathematics, 5, 113-138.
20. Theunissen, T. J. J. M. (1985). Binary programming and test design. Psychometrika, 50, 411-420.
21. Theunissen, T. J. J. M. (1986). Some applications of optimal algorithms in lest design and adaptive testing. Applied Psychological Measurement, 10, 381-389.
22. Van der Linden, W. J., & Boekkooi-Timminga, E. (1989). A maximum model for test design with practical constraints. Psychometrika, 54, 237-247.