\documentclass[12pt]{article}
\usepackage{amsmath,amssymb,amsfonts}
\begin{document}
In this paper, an approximation algorithm for solving nonconvex multiobjective
programming problems (NCMOPs) is presented.We modify Bensonï¿½??s method
using cones instead of hyperplanes. This algorithm uses an inner approximation and
an outer approximation to generate (weakly) efficient solutions and (weakly Îµ-) nondominated
points of NCMOPs. Some numerical examples are presented to clarify the
proposed algorithm.
\end{document}