Approximately efficient solutions in vector optimization

Approximately efficient solutions in vector optimization

0.00 Avg rating0 Votes
Article ID: iaor19972537
Country: United Kingdom
Volume: 5
Issue: 4
Start Page Number: 271
End Page Number: 278
Publication Date: Dec 1996
Journal: Journal of Multi-Criteria Decision Analysis
Authors:
Abstract:

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 elelemt 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.

Reviews

Required fields are marked *. Your email address will not be published.