Abstract
In this paper, a method using generalized data envelopment analysis and genetic algorithms is proposed for finding efficient frontiers in multi-objective optimization problems. The proposed method can yield desirable efficient frontiers even in nonconvex cases. It will be proved that the proposed method overcomes shortcomings of existing methods through several numerical examples.