𝒙 is a non-dominated solution if there is no other solution that dominates it. The set of all nondominated solutions is referred as Pareto Optimal Set (POS), and its corresponding objective vectors as Pareto Front (PF) (see blue dashed lines in Fig. , top left). For a cMOOP, the objectives need to be simultaneously optimized while satisfying the inequality constraints 𝑐 𝑖∈[1:𝑘] (𝒙). A solution is said to be feasible if it satisfies all the constraints, and unfeasible if any of the constraints is not satisfied. Thus, the constrained POS is defined as the ensemble of feasible non-dominated solutions and the constrained PF as its corresponding objective values (red lines in Fig. , top left).