Oscar and Olaf are teachers with a total of 108 exams to grade. They have three days to complete the task. Oscar has 12 hours available and Olaf has 10 hours available to do the first pass of grading on the exams. They are trying to figure out how much time they need to set aside for regrading, an unfortunate, but sometimes necessary task. It takes Oscar 7.2 minutes on average to grade an exam and it takes Olaf twelve minutes. However, Oscar will catch errors on the way back that will force him to regrade 10% of his exams, while Olaf will only have to regrade 6% of his. How many exams should each of them grade to minimize the number of exams that they have to regrade?

Formulate this problem as a Linear Program in standard form.

Solve for the optimal solution using graphical techniques. Clearly depict the constraints, feasible region, objective function, and optimal solution.

Answer the following the questions.

1. How many TEEs should Oscar and Olaf each grade?

2. How many exams need to be regraded with this assignment strategy?

3. Which constraints are binding?