Pareto Robust Functionality

[vgupta1]

Given how common non-pro solutions seem to be, it would be nice to have some general way to do this if its flagged, e.g.:

• Check if zero is a member of the unc set, and if so, do report PRO for zero
• Take an element u from the user, and then update the sol to be PRO for u

Some complications are how to do this if we take a different unc. set for each constraint or how oracles should be expected to support this solution. Thoughts? I'd advocate asking Dimitris to make this a coding-based final project for one of his more capable students in the robust class :).

[IainNZ]

This is definitely a Good Idea but will take some thought re:interface