Article ID: | iaor20133925 |
Volume: | 206 |
Issue: | 1 |
Start Page Number: | 595 |
End Page Number: | 610 |
Publication Date: | Jul 2013 |
Journal: | Annals of Operations Research |
Authors: | Veldkamp Bernard |
Keywords: | robust optimization, assembly, programming (binary) |
In automated test assembly (ATA), 0‐1 linear programming (0‐1 LP) methods are applied to select questions (items) from an item bank to assemble an optimal test. The objective in this 0‐1 LP optimization problem is to assemble a test that measures, in as precise a way as possible, the ability of candidates. Item response theory (IRT) is commonly applied to model the relationship between the responses of candidates and their ability level. Parameters that describe the characteristics of each item, such as difficulty level and the extent to which an item differentiates between more and less able test takers (discrimination) are estimated in the application of the IRT model. Unfortunately, since all parameters in IRT models have to be estimated, they do have a level of uncertainty to them. Some of the other parameters in the test assembly model, such as average response times, have been estimated with uncertainty as well. General 0‐1 LP methods do not take this uncertainty into account, and overestimate the predicted level of measurement precision. In this paper, alternative robust optimization methods are applied. It is demonstrated how the Bertsimas and Sim method can be applied to take this uncertainty into account in ATA. The impact of applying this method is illustrated in two numerical examples. Implications are discussed, and some directions for future research are presented.