Approximately Efficient Solutions in Vector Optimization
β Scribed by Tamaki Tanaka
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 596 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1057-9214
No coin nor oath required. For personal study only.
β¦ Synopsis
An approach to approximating solutions in vector optimization is developed for vector optimization problems with arbitrary ordering cones. This paper presents a study of approximately efficient points of a given set with respect to a convex cone in an ordered Banach space. Existence results for such approximately efficient points are obtained. A domination property related to these existence results is observed and then it is proved that each element of a given set is approximated by the sum of a point in a convex cone inducing the ordering and a point in a finite set consisting of such approximately efficient points of the set.
π SIMILAR VOLUMES
The notion of strict minimum of order m for real optimization problems is extended to vector optimization. Its properties and characterization are studied in Ε½ . the case of finite-dimensional spaces multiobjective problems . Also the notion of super-strict efficiency is introduced for multiobjectiv
We define the generalized efficient solution which is more general than the weakly efficient solution for vector optimization problems, and prove the existence of the generalized efficient solution for nondifferentiable vector optimization problems by using vector variational-like inequalities for s
We introduce an approximation set to the value efficient set in multiobjective problems under partial information on the decision maker's preferences modelled by a vector value function. We show monotonicity and convergence properties based on increasingly precise vector value functions with two com