TY - JOUR
T1 - A zero-one programming approach to Gulliksen's matched random subtests method
AU - van der Linden, Wim J.
AU - Boekkooi-Timminga, Ellen
PY - 1988
Y1 - 1988
N2 - Gulliksen’s matched random subtests method is a graphical method to split a test into parallel test halves. The method has practical relevance because it maximizes coefficient α as a lower bound to the classical test reliability coefficient. In this paper the same problem is formulated as a zero-one programming problem, the advantage being that it can be solved by computer algorithms that already exist. It is shown how the procedure can be generalized to split tests of any length. The paper concludes with an empirical example comparing Gulliksen’s original hand-method with the zero-one programming version. Index terms: Classical test theory, Gulliksen’s matched random subtests method, Item matching, Linear programming, Parallel tests, Test reliability, Zero-one programming.
AB - Gulliksen’s matched random subtests method is a graphical method to split a test into parallel test halves. The method has practical relevance because it maximizes coefficient α as a lower bound to the classical test reliability coefficient. In this paper the same problem is formulated as a zero-one programming problem, the advantage being that it can be solved by computer algorithms that already exist. It is shown how the procedure can be generalized to split tests of any length. The paper concludes with an empirical example comparing Gulliksen’s original hand-method with the zero-one programming version. Index terms: Classical test theory, Gulliksen’s matched random subtests method, Item matching, Linear programming, Parallel tests, Test reliability, Zero-one programming.
U2 - 10.1177/014662168801200210
DO - 10.1177/014662168801200210
M3 - Article
VL - 12
SP - 201
EP - 209
JO - Applied psychological measurement
JF - Applied psychological measurement
SN - 0146-6216
IS - 2
ER -