NotesFAQContact Us
Collection
Advanced
Search Tips
Showing all 6 results Save | Export
Peer reviewed Peer reviewed
Nishisato, Shizuhiko; Arri, P. S. – Psychometrika, 1975
A modified technique of separable programming was used to maximize the squared correlation ratio of weighted responses to partially ordered categories. The technique employs a polygonal approximation to each single-variable function by choosing mesh points around the initial approximation supplied by Nishisato's method. Numerical examples were…
Descriptors: Algorithms, Linear Programing, Mathematical Models, Matrices
Peer reviewed Peer reviewed
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – Psychometrika, 1989
A maximin model for test design based on item response theory is proposed. Only the relative shape of target test information function is specified. It serves as a constraint subject to which a linear programing algorithm maximizes the test information. The model is illustrated, and alternative models are discussed. (TJH)
Descriptors: Algorithms, Latent Trait Theory, Linear Programing, Mathematical Models
Belgard, Maria R.; Min, Leo Yoon-Gee – 1971
An operations research method to optimize the teaching-learning process is introduced in this paper. In particular, a linear programing model is proposed which, unlike dynamic or control theory models, allows the computer to react to the responses of a learner in seconds or less. To satisfy the assumptions of linearity, the seemingly complicated…
Descriptors: Algorithms, Decision Making, Digital Computers, Education
van der Linden, Wim J.; Boekkooi-Timminga, Ellen – 1987
A "maximin" model for item response theory based test design is proposed. In this model only the relative shape of the target test information function is specified. It serves as a constraint subject to which a linear programming algorithm maximizes the information in the test. In the practice of test construction there may be several…
Descriptors: Algorithms, Foreign Countries, Item Banks, Latent Trait Theory
van der Linden, Wim J.; Adema, Jos J. – 1988
Two optimalization models for the construction of tests with a maximal value of coefficient alpha are given. Both models have a linear form and can be solved by using a branch-and-bound algorithm. The first model assumes an item bank calibrated under the Rasch model and can be used, for instance, when classical test theory has to serve as an…
Descriptors: Algorithms, Computer Simulation, Estimation (Mathematics), Foreign Countries
Lam, Tit-Loong; Foong, Yoke-Yeen – 1991
This simulation study involved the design of two two-stage tests in which the routing tests and the second-stage measurement testlets took the form of a multidimensional knapsack problem with prespecified target informations and constraints to be enumerated using the algorithm of E. Balas. Two conventional tests of similar length to the two-stage…
Descriptors: Adaptive Testing, Algorithms, Computer Assisted Testing, Computer Simulation