A Revised Simplex Method for Test Construction Problems. Research Report 90-5.
Saved in:
| Title: | A Revised Simplex Method for Test Construction Problems. Research Report 90-5. |
|---|---|
| Language: | English |
| Authors: | Adema, Jos J., Twente Univ., Enschede (Netherlands). Dept. of Education. |
| Availability: | Bibliotheek, Department of Education, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands. |
| Peer Reviewed: | N |
| Page Count: | 44 |
| Publication Date: | 1990 |
| Document Type: | Reports - Evaluative |
| Descriptors: | Computer Assisted Testing, Equations (Mathematics), Foreign Countries, Item Banks, Item Response Theory, Linear Programing, Mathematical Models, Test Construction |
| Abstract: | Linear programming models with 0-1 variables are useful for the construction of tests from an item bank. Most solution strategies for these models start with solving the relaxed 0-1 linear programming model, allowing the 0-1 variables to take on values between 0 and 1. Then, a 0-1 solution is found by just rounding, optimal rounding, or a heuristic. In most applications, the latter can be executed very rapidly. This paper uses the revised simplex method to solve the relaxed 0-1 linear programming method for test construction. The simplex method is modified such that the characteristics of test construction problems are taken into account. The modifications were implemented in the computer program LINPROG. Two item banks, each containing 450 items, were generated to determine if central processing unit (CPU) time was gained. Computational experiments showed a gain of CPU time for most modifications. Ten tables present the results for the modifications. (Author/SLD) |
| Entry Date: | 1991 |
| Accession Number: | ED326582 |
| Database: | ERIC |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED326582 Name: ERIC Full Text Category: fullText Text: Full Text from ERIC |
|---|---|
| Header | DbId: eric DbLabel: ERIC An: ED326582 AccessLevel: 3 PubType: Report PubTypeId: report PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: A Revised Simplex Method for Test Construction Problems. Research Report 90-5. – Name: Language Label: Language Group: Lang Data: English – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Adema%2C+Jos+J%2E%22">Adema, Jos J.</searchLink><br /><searchLink fieldCode="AR" term="%22Twente+Univ%2E%2C+Enschede+%28Netherlands%29%2E+Dept%2E+of+Education%2E%22">Twente Univ., Enschede (Netherlands). Dept. of Education.</searchLink> – Name: Avail Label: Availability Group: Avail Data: Bibliotheek, Department of Education, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands. – Name: PeerReviewed Label: Peer Reviewed Group: SrcInfo Data: N – Name: Pages Label: Page Count Group: Src Data: 44 – Name: DatePubCY Label: Publication Date Group: Date Data: 1990 – Name: TypeDocument Label: Document Type Group: TypDoc Data: Reports - Evaluative – Name: Subject Label: Descriptors Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+Assisted+Testing%22">Computer Assisted Testing</searchLink><br /><searchLink fieldCode="DE" term="%22Equations+%28Mathematics%29%22">Equations (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Foreign+Countries%22">Foreign Countries</searchLink><br /><searchLink fieldCode="DE" term="%22Item+Banks%22">Item Banks</searchLink><br /><searchLink fieldCode="DE" term="%22Item+Response+Theory%22">Item Response Theory</searchLink><br /><searchLink fieldCode="DE" term="%22Linear+Programing%22">Linear Programing</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+Models%22">Mathematical Models</searchLink><br /><searchLink fieldCode="DE" term="%22Test+Construction%22">Test Construction</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Linear programming models with 0-1 variables are useful for the construction of tests from an item bank. Most solution strategies for these models start with solving the relaxed 0-1 linear programming model, allowing the 0-1 variables to take on values between 0 and 1. Then, a 0-1 solution is found by just rounding, optimal rounding, or a heuristic. In most applications, the latter can be executed very rapidly. This paper uses the revised simplex method to solve the relaxed 0-1 linear programming method for test construction. The simplex method is modified such that the characteristics of test construction problems are taken into account. The modifications were implemented in the computer program LINPROG. Two item banks, each containing 450 items, were generated to determine if central processing unit (CPU) time was gained. Computational experiments showed a gain of CPU time for most modifications. Ten tables present the results for the modifications. (Author/SLD) – Name: DateEntry Label: Entry Date Group: Date Data: 1991 – Name: AN Label: Accession Number Group: ID Data: ED326582 |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=eric&AN=ED326582 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English PhysicalDescription: Pagination: PageCount: 44 Subjects: – SubjectFull: Computer Assisted Testing Type: general – SubjectFull: Equations (Mathematics) Type: general – SubjectFull: Foreign Countries Type: general – SubjectFull: Item Banks Type: general – SubjectFull: Item Response Theory Type: general – SubjectFull: Linear Programing Type: general – SubjectFull: Mathematical Models Type: general – SubjectFull: Test Construction Type: general Titles: – TitleFull: A Revised Simplex Method for Test Construction Problems. Research Report 90-5. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Twente Univ., Enschede (Netherlands). Dept. of Education. – PersonEntity: Name: NameFull: Adema, Jos J. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 09 Type: published Y: 1990 |
| ResultId | 1 |
