A Note on Solving Large-Scale Zero-One Programming Problems. Research Report 88-4.

Autor/in	Adema, Jos J.
Institution	Twente Univ., Enschede (Netherlands). Dept. of Education.
Titel	A Note on Solving Large-Scale Zero-One Programming Problems. Research Report 88-4.
Quelle	(1988), (17 Seiten) PDF als Volltext kostenfreie Datei Verfügbarkeit
Sprache	englisch
Dokumenttyp	gedruckt; online; Monographie
Schlagwörter	Achievement Tests; Computer Assisted Testing; Heuristics; Item Banks; Problem Solving; Programing; Test Construction; Test Reliability; Testing Problems + Suchen Sie Ihr Suchwort? Achievement test; Achievement; Testing; Test; Tests; Leistungsbeurteilung; Leistungsüberprüfung; Leistung; Testdurchführung; Testen; Heuristik; Problemlösen; Testaufbau; Testreliabilität
Abstract	A heuristic for solving large-scale zero-one programming problems is provided. The heuristic is based on the modifications made by H. Crowder et al. (1983) to the standard branch-and-bound strategy. First, the initialization is modified. The modification is only useful if the objective function values for the continuous and the zero-one programming problems are close to each other. Given the initialization, the branch-and-bound method is stopped when a feasible solution to the problem is found. The heuristic also uses the reduced costs to fix non-basic variables to 1 or 0. An example taken from achievement test construction illustrates the efficiency of the proposed heuristic. Several test construction problems were implemented and solved by the proposed heuristic for item banks with 400 items. Modifications were introduced in the LANDO computer program. A table illustrates that the central processing unit times for solving the zero-one programming problem were close to the times needed to solve the continuous problem. (SLD)
Anmerkungen	Bibliotheek, Department of Education, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands.
Erfasst von	ERIC (Education Resources Information Center), Washington, DC