Implement optimization problems

[meisterT]

• This is meant for problems where there is no "correct" answer.
• The grader spits out a (float) number that is representative how "good" the submission is.
• The maximum of all submissions for that problem is taken as points for this problem.

(There could be variant where you take the minimum instead, but I would argue that the problem/grader could be changed so that it's always the maximum.)

It's not really clear to me how the Kattis problem format handles these, e.g. what is the spec for how to output points. Example problems welcome!

[meisterT]

Possible future extensions:

• allow combining with partial scoring: Implement partial scoring #2518
• allow combining with interactive problems

[as6325400]

I think we can discuss how to implement this?

When I took the data structures course, there was a professor who would always include NP-hard problems in the assignments for students to compete on.

At that time, the professor had to create an additional form to track everyone's scores.

If we had a feature that automatically updates the scoreboard with the scores, it would be much more convenient.

[meisterT]

Does anyone have example problems that fit into this category?