I. Introduction
Multiobjective optimization problems (MOP) involve multiple conflicting, incomparable, and noncommensurable objective functions. The conflict, incomparability, and noncommensurability of the objectives imply that an MOP corresponds to a nonsingular set of Pareto-optimal solutions characterized by trade-off in the performance in various objectives [1]. Improvement in one objective is gained only with degradation in another such that in the objective space of the MOP at hand, the corresponding Pareto-optimal set form a nondominated front, the Pareto-front.