An approximation method for the efficiency set of multiobjective programming problems
Hagen Reuter · Optimization · 1990
In this paper so-called ε-approximations for the efficiency set of vector minimization problems are defined. A general generating algorithm for such E-approximations is given which will be modified for linear continuous problems by means of the Dual Simplex Method.