Linear programming models with 0-1 variables are useful for the construction of tests from an item bank. Most solution strategies for these models start with solving the relaxed 0-1 linear programming model, allowing the 0-1 variables to take on values between 0 and 1. Then, a 0-1 solution is found by just rounding, optimal rounding, or a heuristic. In most applications, the latter can be executed very rapidly. This paper uses the revised simplex method to solve the relaxed 0-1 linear programming method for test construction. The simplex method is modified such that the characteristics of test construction problems are taken into account. The modifications were implemented in the computer program LINPROG. Two item banks, each containing 450 items, were generated to determine if central processing unit (CPU) time was gained. Computational experiments showed a gain of CPU time for most modifications. Ten tables present the results for the modifications.
|Place of Publication||Enschede|
|Publisher||University of Twente, Faculty Educational Science and Technology|
|Number of pages||36|
|Publication status||Published - 1990|
|Name||OMD research report|
|Publisher||University of Twente, Faculty of Educational Science and Technology|
- Foreign Countries
- Linear Programing
- Mathematical Models
- Computer Assisted Testing
- Test Construction
- Item Banks
- Item Response Theory
- Equations (Mathematics)
Adema, J. J., & Adema, J. J. (1990). A revised simplex method for test construction problems. (OMD research report; No. 90-5). Enschede: University of Twente, Faculty Educational Science and Technology.