Using Set Covering with Item Sampling to Analyze the Infeasibility of Linear Programming Test Assembly Models

This article shows how set covering with item sampling (SCIS) methods can be used in the analysis and preanalysis of linear programming models for test assembly (LPTA). LPTA models can construct tests, fulfilling a set of constraints set by the test assembler. Sometimes, no solution to the LPTA model exists. The model is then said to be infeasible. Causes of infeasibility can be difficult to find. A method is proposed that constitutes a helpful tool for test assemblers to detect infeasibility before hand and, in the case of infeasibility, give insight into its causes. This method is based on SCIS. Although SCIS can help to detect feasibility or infeasibility, its power lies in pinpointing causes of infeasibility such as irreducible infeasible sets of constraints. Methods to resolve infeasibility are also given, minimizing the model deviations. A simulation study is presented, offering a guide to test assemblers to analyze and solve infeasibility.

[1]  Stephen B. Maurer,et al.  Linear Programs and Related Problems , 1992 .

[2]  Martha L. Stocking,et al.  A Method for Severely Constrained Item Selection in Adaptive Testing , 1992 .

[3]  F. Lord.  Applications of Item Response Theory To Practical Testing Problems , 1980 .

[4]  Richard M. Leucht.  Computer-Assisted Test Assembly Using Optimization Heuristics. , 1998 .

[5]  John M. Wilson,et al.  Advances in Sensitivity Analysis and Parametric Programming , 1998, J. Oper. Res. Soc..

[6]  John W. Chinneck,et al.  Fast Heuristics for the Maximum Feasible Subsystem Problem , 2001, INFORMS J. Comput..

[7]  A. Pascu.  Operational research '81: J.P. Brans (Ed.) Proceedings of the Ninth IFORS International Conference on Operational Research, Hamburg, Germany, July 20–24, 1981, North-Holland, Amsterdam, 1981, xx + 984 pages, Dfl.250.000 , 1982 .

[8]  Jayaram K. Sankaran.  A note on resolving infeasibility in linear programs by constraint relaxation , 1993, Oper. Res. Lett..

[9]  John W. Chinneck,et al.  Feasibility and Viability , 1997 .

[10]  Ellen Boekkooi-Timminga.  The Construction of Parallel Tests From IRT-Based Item Banks , 1989 .

[11]  Edoardo Amaldi,et al.  From finding maximum feasible subsystems of linear systems to feedforward neural network design , 1994 .

[12]  T. Theunissen.  Binary programming and test design , 1985 .

[13]  W. D. Linden,et al.  Achievement test construction using 0-1 linear programming , 1991 .

[14]  John W. Chinneck,et al.  Locating Minimal Infeasible Constraint Sets in Linear Programs , 1991, INFORMS J. Comput..

[15]  B. Veldkamp.  Multiple Objective Test Assembly Problems , 1998 .

[16]  G. Nemhauser,et al.  Integer Programming , 2020 .

[17]  Harvey J. Greenberg,et al.  Intelligent analysis support for linear programs , 1992 .

[18]  Ellen Timminga,et al.  Solving Infeasibility Problems in Computerized Test Assembly , 1998 .

[19]  John W. Chinneck,et al.  MINOS(IIS): Infeasibility analysis using MINOS , 1994, Comput. Oper. Res..

[20]  M. Stocking,et al.  A Model and Heuristic For Solving Very Large Item Selection Problems , 1993 .

[21]  Ellen Boekkooi-Timminga.  Simultaneous test construction by zero-one programming , 1986 .

[22]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[23]  Willem J. van der Linden.  Optimal Assembly of Tests with Item Sets , 2000 .

[24]  Martha L. Stocking,et al.  A Method for Severely Constrained Item Selection in Adaptive Testing , 1992 .

[25]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[26]  Harvey J. Greenberg,et al.  A bibliography for the development of an Intelligent Mathematical Programming System , 1996, Ann. Oper. Res..

[27]  Bernard P. Veldkamp,et al.  Multidimensional Constrained Test Assembly , 2002 .

[28]  R. Luecht.  Computer-Assisted Test Assembly Using Optimization Heuristics , 1998 .

[29]  Harvey J. Greenberg,et al.  Analyze: A computer-assisted analysis system for linear programming models , 1987 .

[30]  Ronald D. Armstrong,et al.  IRT Test Assembly Using Network-Flow Programming , 1998 .

[31]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[32]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[33]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[34]  Sheldon M. Ross,et al.  Introduction to Probability Models (4th ed.). , 1990 .

[35]  M. R. Novick,et al.  Statistical Theories of Mental Test Scores. , 1971 .

[36]  W. D. Linden,et al.  A maximin model for IRT-based test design with practical constraints , 1989 .

[37]  Martha L. Stocking,et al.  Application of an Automated Item Selection Method to Real Data , 1993 .

[38]  T. Theunissen.  Some Applications of Optimization Algorithms in Test Design and Adaptive Testing , 1986 .