Various mathematical programming approaches toward item selection
Door: Kester, J.G. | 01-01-1988 This study concerns the item selection problem, which is a problem from test theory, where items are chosen in order to design a test that fulfils certain demands in the best possible way.This item selection problem can be formulated as a mathematical programming problem. The derivation of this is based on the so-called Rasch model.
In previous work on this subject a large area already has been covered. In this report the earlier results are
examined in order to get a good picture of the explored and unexplored fields.
After that some new methods to solve the problem are described, all dealing with situations where cost
minimization is the objective, whereas some methods also take care of a special category division for the selected items.
Finally the results of a number of experiments are reported, incorporating the most important algorithms.
Some conclusions about the use of these methods are summarized.
Kunnen we je helpen?
Stel je vraag via onze kanalen of kijk in de veelgestelde vragen.
Voor scholen: Vergeet niet om het brinnummer bij de hand te hebben en/of in de mail te vermelden, zodat we jouw vraag sneller kunnen behandelen!