Using set covering with item sampling to analyze the infeasibility of linear programming test assembly models

Applied Psychological Measurement

Volumn 28, Issue 5, 2004, Pages 355-375

  Huitzing, Hiddo A ^a  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

Author keywords

Infeasibility; Item sampling; Linear programming; Mathematical programming; Optimal test assembly; Set covering; Test assembly; Test design

Indexed keywords

EID: 4444341876     PISSN: 01466216     EISSN: None     Source Type: Journal    
DOI: 10.1177/0146621604266152     Document Type: Article

References (35)

1. Adema, J. J., Boekkooi-Timminga, E., & van der Linden, W. J. (1991). Achievement test construction using 0-1 linear programming. European Journal of Operations Research, 55, 103-111.
2. Amaldi, E. (1994). From finding maximum feasible subsystems of linear systems to feedforward neural network design. Unpublished doctoral dissertation, Département de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, Switzerland.
3. Armstrong, R. D., Jones, D. H., & Kunes, C. S. (1998). IRT test assembly using network-flow programming. Applied Psychological Measurement 22, 237-247.
4. Birnbaum, A. (1968). Some latent trait models. In F. M. Lord & M. R. Novick (Eds.), Statistical theories of mental test scores. Reading, MA: Addison-Wesley.
5. Boekkooi-Timminga, E. (1987). Simultaneous test construction by zero-one programming. Methodika, 1, 101-112.
6. Boekkooi-Timminga, E. (1990). The construction of parallel tests from IRT-based item banks. Journal of Educational Statistics, 15, 129-145.
7. Boneh, A. (1984). Identification of redundancy by a set-covering equivalence. In J. P. Brans (Ed.), Operational research '84 (pp. 407-422). Amsterdam: Elsevier.
8. Brooke, A., Kendrick, D., Meeraus, A., Raman, R., (1998). GAMS, a user's guide [Computer software and manual]. Washington, DC: GAMS Development Corporation.
9. Chinneck, J. W. (1993). Infeasibility analysis using MINOS. Computers and Operations Research, 21, 1-9.
10. Chinneck, J. W. (1997). Feasibility and viability. In T. Gal & H. J. Greenberg (Eds.), Advances in sensitivity analysis and parametric programming (pp. 14.1-14.41). Boston: Kluwer Academic.
11. Chinneck, J. W. (2000). Fast heuristics for the maximum feasible subsystem problem (Tech. Rep. SCE-00-02). Ottawa, Canada: Systems and Computer Engineering, Carleton University.
12. Chinneck, J. W., & Dravnieks, E. W. (1991). Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing, 3, 157-168.
13. Feng, J. (1999). Nonlinear redundancy: Where is the information? Unpublished master's thesis, University of Waterloo, Canada.
14. Greenberg, H. J. (1987). Intelligent analysis support for linear programs. Operations Research Letters, 6, 249-255.
15. Greenberg, H. J. (1996). A bibliography for the development of an intelligent mathematical programming system. Annals of Operations Research, 65, 55-90.
16. Huitzing, H. A. (in press). Solving infeasible linear programming test assembly models. Journal of Educational Measurement.
17. Huitzing, H. A. (2002). NuzLight: Free academic computer software for LPTA models, using different solvers. Groningen: University of Groningen. Available http:www.oprit.rug.nl/huitzing/research.html
18. Lord, F. M. (1980). Applications of item response theory to practical testing problems. Hillsdale, NJ: Lawrence Erlbaum.
19. Luecht, R. M. (1998). Computer-assisted test assembling using optimization heuristics. Applied Psychological Measurement, 22, 224-236.
20. Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. New York: John Wiley.
21. Nering, E. D., & Tucker, A. W. (1993). Linear programs and related problems. Boston: Academic Press.
22. Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: Algorithms and complexity. Englewood Cliffs, NJ: Prentice Hall.
23. Ross, S. M. (1993). Introduction toprobability models (5th ed.). Boston: Academic Press.
24. Sankaran, J. K. (1993). A note on resolving infeasibility in linear programs by constraint relaxation. Operations Research Letters, 13, 19-20.
25. Stocking, M. L., & Swanson, L. (1993). A model and heuristic for solving very large item selection problems. Applied Psychological Measurement, 17, 151-166.
26. Swanson, L., & Stocking, M. L. (1993). A method for severely constrained item selection in adaptive testing. Applied Psychological Measurement, 17, 277-292.
27. Swanson, L., Stocking, M. L., & Pearlman, M. (1993). Application of an automated item selection method to real data. Applied Psychological Measurement, 17, 167-176.
28. Timminga, E. (1998). Solving infeasibility problems in computerized test assembly. Applied Psychological Measurement, 22, 280-291.
29. Theunissen, T. J. J. M. (1985). Binary programming and test design. Psychometrika, 50, 411-420.
30. Theunissen, T. J. J. M. (1986). Optimization algorithms in test design. Applied Psychological Measurement, 10, 381-389.
31. van der Linden, W. J. (2000). Optimal assembly of tests with item sets. Applied Psychological Measurement, 24, 225-240.
32. van der Linden, W. J., & Boekkooi-Timminga, E. (1989). A maximin model for test design with practical constraints. Psychometrika, 54, 237-247.
33. Veldkamp, B. P. (1999). Multiple objective test assembly problems. Journal of Educational Measurement, 36, 253-266.
34. Veldkamp, B. P. (2002). Multidimensional constrained test assembly. Applied Psychological Measurement, 26, 133-146.
35. Wolsey, L. A. (1998). Integer programming. New York: John Wiley.