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.
No takes yet. Share an insight, caveat, or question.
Hagen Reuter (1990) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: