Comparison of Integer Programming ( IP ) Solvers for Automated Test Assembly ( ATA )

  • Donoghue J
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

At the heart of van der Linden's approach to automated test assembly ( ATA ) is a linear programming/integer programming ( LP / IP ) problem. A variety of IP solvers are available, ranging in cost from free to hundreds of thousands of dollars. In this paper, I compare several approaches to solving the underlying IP problem. These approaches range from traditional computer programming, through LP / IP ‐specific modeling languages, to plug‐ins for common software such as Excel. The features of several of the major IP solvers are briefly reviewed, describing which of the features are more or less useful in the context of ATA . The appendices include a list of resources that I have found particularly useful. Report Number: ETS RR–15–05

Cite

CITATION STYLE

APA

Donoghue, J. R. (2015). Comparison of Integer Programming ( IP ) Solvers for Automated Test Assembly ( ATA ). ETS Research Report Series, 2015(1), 1–12. https://doi.org/10.1002/ets2.12051

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free