NotesFAQContact Us
Collection
Advanced
Search Tips
Back to results
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ951764
Record Type: Journal
Publication Date: 2011-Nov
Pages: 2
Abstractor: As Provided
Reference Count: 2
ISBN: N/A
ISSN: ISSN-0146-6216
JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly
Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon
Applied Psychological Measurement, v35 n8 p643-644 Nov 2011
JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and branch-and-bound (BB) method to find an integer solution (Bazaraa, Jarvis, & Sherali, 1990). The input configuration file format for linear programming (LP) modeling (van der Linden, 2005) is tailored for ATA and easy to build without the help of other modeling languages. It was originally designed for midsized test assembly applications, but there is no restriction on the number of decision variables. This solver might be useful for research students who need to assemble a test from an item pool and for those who want to learn or teach LP concepts.
SAGE Publications. 2455 Teller Road, Thousand Oaks, CA 91320. Tel: 800-818-7243; Tel: 805-499-9774; Fax: 800-583-2665; e-mail: journals@sagepub.com; Web site: http://sagepub.com
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A