A new approach is presented to handle constraints optimization using evolutionary algorithms. It neither uses any penalty function nor makes distinction between feasible solutions and infeasible solutions. The new technique treats constrained optimization as a two-objective optimization. One objective is original objective function, the other is the degree violating the constraints. Individual抯 ranking procedure is based on its Pareto strength which appears first in multi-objective optimization. Pareto strength evaluates an individual抯 fitness dependent on the number of dominated points in the population. By combining Pareto strength ranking procedure with minimal generation gap modal, a new real-coded genetic algorithm is proposed. The new approach is compared against other evolutionary optimization techniques in several benchmark functions. The results obtained show that the new approach is a general, effective and robust method. Its performance outperforms some other techniques. Especially for some complicated optimization problems with inequality and equality constraints, the proposed method provides better numerical accuracy.