Abstract
Item banks, large sets of test items, can be used for the construction of achievement tests. Mathematical programming models have been proposed for the selection of items from an item bank for a test. These models make automated test construction possible. However, to find an optimal or even an approximate optimal solution to a test construction model can be time consuming. This paper shows how test construction models, and in particular the Maximin Model, are solvable by the program MPSX/370 V2. This program offers the user several implementations of the branch-and-bound method, which can be used for solving test construction models. Several implementations are compared. The results show that test construction models are solvable in a practical amount of time if the user applies the options offered by the program in an intelligent way. An appendix describes the Extended Control Language (ECL) computer program.
| Original language | Undefined |
|---|---|
| Place of Publication | Enschede, the Netherlands |
| Publisher | University of Twente, Faculty Educational Science and Technology |
| Publication status | Published - 1989 |
Publication series
| Name | OMD research report |
|---|---|
| Publisher | University of Twente, Faculty of Educational Science and Technology |
| No. | 89-06 |
Keywords
- Test Construction
- Test Items
- Item Banks
- Item Response Theory
- Mathematical Models
- Computer Assisted Testing
- Computer Software
- IR-104189
- Achievement Tests
- Search Strategies
Cite this
Adema, J. J. (1989). Implementations of the branch-and-bound method for test construction problems. (OMD research report; No. 89-06). Enschede, the Netherlands: University of Twente, Faculty Educational Science and Technology.