Polynomial Algorithms for Item Matching

Ronald D. Armstrong, Douglas H. Jones

Research output: Contribution to journalArticle

11 Scopus citations

Abstract

To estimate test reliability and to create parallel tests, test items frequently are matched. Items can be matched by splitting tests into parallel test halves, by creating T splits, or by matching a desired test form. Problems often occur. Algorithms are presented to solve these problems. The algorithms are based on optimization theory in networks (graphs) and have polynomial complexity. Computational results from solving sample problems with several hundred decision variables are reported.

Original languageEnglish (US)
Pages (from-to)365-371
Number of pages7
JournalApplied Psychological Measurement
Volume16
Issue number4
DOIs
StatePublished - Dec 1992

All Science Journal Classification (ASJC) codes

  • Social Sciences (miscellaneous)
  • Psychology (miscellaneous)

Cite this