I've looked at min/max and critical points. Either I am not understanding them, or they don't apply to the general category of problems I am trying to solve, which come in this form: Let there be a sequence X of ordered pairs (x, y). Find a best term within X that satisfies the following conditions: - The term's 1st index is minimized out of all possible 1st index elements in X. AND - The term's 2st index is maximized out of all possible 2nd index elements in X. Thanks in advance for any help. I am hoping to find a non-heuristic solution, if any exist.