Locating minimal sets using polyhedral cones

Locating minimal sets using polyhedral cones

0.00 Avg rating0 Votes
Article ID: iaor201111211
Volume: 39
Issue: 6
Start Page Number: 466
End Page Number: 470
Publication Date: Nov 2011
Journal: Operations Research Letters
Authors: ,
Keywords: optimization
Abstract:

The first method to locate efficient points of a nonempty set introduced by Yu (1974) 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 a K‐essential set to describe the set of all dominating points of a set.

Reviews

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