A zero-one programming approach to Gulliksen's matched random subtests method

Van der Linden, Wim J.
Boekkooi-Timminga, Ellen
1988
Thumbnail Image

View/Download File

v12n2p201.pdf (937.97 KB)

Persistent link to this item

https://hdl.handle.net/11299/104226
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

A zero-one programming approach to Gulliksen's matched random subtests method

Authors

Published Date

1988

Publisher

Type

Article

Abstract

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.

Keywords

Description

Related to

Replaces

License

Collections

Applied Psychological Measurement, Volume 12, 1988

Series/Report Number

Funding information

Isbn identifier

Doi identifier

Previously Published Citation

Van der Linden, Wim J & Boekkooi-Timminga, Ellen. (1988). A zero-one programming approach to Gulliksen's matched random subtests method. Applied Psychological Measurement, 12, 201-209. doi:10.1177/014662168801200210

Other identifiers

doi:10.1177/014662168801200210

Suggested citation

Van der Linden, Wim J.; Boekkooi-Timminga, Ellen. (1988). A zero-one programming approach to Gulliksen's matched random subtests method. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/104226.

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.