A Revised Simplex Method for Test Construction Problems. Research Report 90-5.

Saved in:
Bibliographic Details
Title: A Revised Simplex Method for Test Construction Problems. Research Report 90-5.
Language: English
Authors: Adema, Jos J., Twente Univ., Enschede (Netherlands). Dept. of Education.
Availability: Bibliotheek, Department of Education, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands.
Peer Reviewed: N
Page Count: 44
Publication Date: 1990
Document Type: Reports - Evaluative
Descriptors: Computer Assisted Testing, Equations (Mathematics), Foreign Countries, Item Banks, Item Response Theory, Linear Programing, Mathematical Models, Test Construction
Abstract: Linear programming models with 0-1 variables are useful for the construction of tests from an item bank. Most solution strategies for these models start with solving the relaxed 0-1 linear programming model, allowing the 0-1 variables to take on values between 0 and 1. Then, a 0-1 solution is found by just rounding, optimal rounding, or a heuristic. In most applications, the latter can be executed very rapidly. This paper uses the revised simplex method to solve the relaxed 0-1 linear programming method for test construction. The simplex method is modified such that the characteristics of test construction problems are taken into account. The modifications were implemented in the computer program LINPROG. Two item banks, each containing 450 items, were generated to determine if central processing unit (CPU) time was gained. Computational experiments showed a gain of CPU time for most modifications. Ten tables present the results for the modifications. (Author/SLD)
Entry Date: 1991
Accession Number: ED326582
Database: ERIC
Be the first to leave a comment!
You must be logged in first