A new algorithm is proposed to solve constrained multi-objective problems in this paper. The constraints of the MOPs are taken account of in determining Pareto dominance. As a result, the feasibility of solutions is not an issue. At the same time, it takes advantage of both the orthogonal design method to search evenly, and the statistical optimal method to speed up the computation. The output of the technique is a large set of solutions with high precision and even distribution. Notably, for an engineering problem WATER, it finds the Pareto-optimal set, which was previously unknown.