In this talk, we provide a quick overview of representation approaches for multiobjective optimization. We then focus on a bilevel programming subproblem that is capable of delivering a nondominated solution that comes from a given set, provided that one exits. If the Decision Maker’s preferences are known a priori, they can be used to specify the given set. Alternatively, we describe how the subproblem can be used to obtain a representation of the nondominated set when the Decision Maker’s preferences are not available. This requires a thorough search of the outcome space. The search can be facilitated by a partitioning scheme similar to the ones used in global optimization. While building a discrete representation, the algorithm also generates an approximation of the nondominated set within the specified coverage error. We illustrate the algorithm on the multiobjective linear programming problem. We discuss potential application areas and possibilities for further research.