Three methods for robust grading

DOI10.1016/J.EJOR.2018.06.019MaRDI QIDQ1991142zbMATH OpenOpenAlexWikidataFDO

Authors Samuel Burer, Veronica Piccialli

Publication date 30 October 2018

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2018.06.019

zbMATH Keywords

robust optimizationhigher educationbranch-and-boundmixed-integer linear programminggrading

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Minimax problems in mathematical programming (90C47) Mixed integer programming (90C11)

Recommendations

• A regression approach to fairer grading
• Grading exams: 100,99,98,\(\dots \) or \(A,B,C\)?
• Information Loss in Grade Point Conversion
• Dropping Lowest Grades
• The Price of Robustness

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Nonconvex, lower semicontinuous piecewise linear optimization
• Robust Optimization of Large-Scale Systems
• Robust optimization
• Robust optimization - a comprehensive survey
• Theory and applications of robust optimization

Cited in

(4)

• A regression approach to fairer grading
• Grading exams: 100,99,98,\(\dots \) or \(A,B,C\)?
• Information Loss in Grade Point Conversion
• scientific article; zbMATH DE number 2170890 (Why is no real title available?)

This page was built for publication: Three methods for robust grading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991142)