  In this article, we use the monotonic optimization approach to propose an
outcome-space outer approximation by copolyblocks for solving strictly
quasiconvex multiobjective programming problems and especially in the case that
the objective functions are nonlinear fractional. After the algorithm is
terminated, with any given tolerance, we obtain an approximation of the weakly
efficient solution set, that contains the whole weakly efficient solution set
of the problem. The algorithm is proved to be convergent and it is suitable to
be implemented in parallel using standard convex programming tools. Some
computational experiments are reported to show the accuracy and efficiency of
the proposed algorithm.
