Publication year: 2011
Source: Operations Research Letters, Available online 6 September 2011
Elvira Hernández, Luis Rodríguez-Marín
In this paper we develop a theory of localization for minimal sets of a familyof nonempty subsets ofby considering polyhedral cones. To this end we consider the first method to locate all efficient points of a nonempty setintroduced by Yu (1974) [10].
Highlights
► The first method to locate efficient points of a nonempty set introduced by Yu (1974) [10] can be extend to set optimization. ► We examine set-valued optimization problems by using the set criterion. ► We study minimal sets by using polyhedral cones. ► We introduce the notion of-essential set to describe the set of all dominating points of a set.