In this paper so-called •-approximations for the efficiency set of vector minimization problems are defined. A general generating algorithm for such •-approximations is given which will be modified for linear continuous problems by means of the Dual Simplex Method.
