In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is solved iteratively. This finds minimum ‘distance’ from reference point, usually taken as vertex current approximation, upper image through given direction. We propose efficient methods select parameters (the point an...
