A model and heuristic for solving very large item selection problems

Loading...
Thumbnail Image

View/Download File

Persistent link to this item

Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

A model and heuristic for solving very large item selection problems

Published Date

1993

Publisher

Type

Article

Abstract

A model for solving very large item selection problems is presented. The model builds on previous work in binary programming applied to test construction. 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 particularly 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. Index terms: expert systems, heuristic algorithms, item response theory, linear programming, mathematical programming, test assembly, test construction, test design.

Keywords

Description

Related to

Replaces

License

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Swanson, Len & Stocking, Martha L. (1993). A model and heuristic for solving very large item selection problems. Applied Psychological Measurement, 17, 151-166. doi:10.1177/014662169301700205

Suggested citation

Swanson, Len; Stocking, Martha L.. (1993). A model and heuristic for solving very large item selection problems. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/116325.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.