A Model and Heuristic For Solving Very Large Item Selection Problems

Abstract
A model for solving very large item selection problems is presented. The model builds on previous work in binary programming applied to test con struction. Expert test construction practices are applied to situations in which all specifications for item selection cannot necessarily be met. A heuristic for selecting items that satisfy the constraints in the model also is presented. The heuristic is particu larly useful for situations in which the size of the test construction problem exceeds the limits of current implementations of linear programming algorithms. A variety of test construction problems involving real test specifications and item data from actual test assemblies were investigated using the model and the heuristic.

This publication has 5 references indexed in Scilit: