.png){kind=icon}
返回
Three methods for robust grading
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.06.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose three strategies by which a professor of a university course can assign final letter grades taking into account the natural uncertainty in students' individual assignment and final numerical grades. The first strategy formalizes a common technique that identifies large gaps in the final numerical grades. For the second and third strategies, we introduce the notion of a borderline student, that is, a student who is close to, but below, the breakpoint for the next highest letter grade. Using mixed-integer linear programming and a tailor-made branch-and-bound algorithm, we choose the letter-grade breakpoints to minimize the number of borderline students. In particular, the second strategy treats the uncertainty implicitly and minimizes the number of borderline students, while the third strategy uses a robust-optimization approach to minimize the maximum number of borderline students that could occur based on an explicit uncertainty set. We compare the three strategies on realistic instances and identify overall trends as well as some interesting exceptions. While no strategy appears best in all cases, each can be computed in a reasonable amount of time for a moderately sized course. Moreover, they collectively provide the professor important insight into how uncertainty affects the assignment of final letter grades. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Robust optimization
Mixed-integer linear programming
Branch-and-bound
Grading
Higher education
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Expansion of CD4+CD25+ regulatory T cells by intravenous immunoglobulin: a critical factor in controlling experimental autoimmune encephalomyelitis.png)
Blood
OAAI
BloodIF0
OAAI分享收藏 没有更多内容
没有更多内容