An approximation method for the efficiency set of multiobjective programming problems
- 1 January 1990
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 21 (6) , 905-911
- https://doi.org/10.1080/02331939008843621
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- ?-solutions in vector minimization problemsJournal of Optimization Theory and Applications, 1984
- MULTICRITERIA OPTIMIZATION: A GENERAL CHARACTERIZATION OF EFFICIENT SOLUTIONS*Decision Sciences, 1979
- Efficiency in multiple objective optimization problemsMathematical Programming, 1977
- Vektormaximumproblem und parametrische optimierungMathematische Operationsforschung und Statistik, 1973
- Proper efficiency and the theory of vector maximizationJournal of Mathematical Analysis and Applications, 1968