• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar

information for practice

news, new scholarship & more from around the world


advanced search
  • gary.holden@nyu.edu
  • @ Info4Practice
  • Archive
  • About
  • Help
  • Browse Key Journals
  • RSS Feeds

Locating minimal sets using polyhedral cones

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.

Posted in: Journal Article Abstracts on 09/22/2011 | Link to this post on IFP |
Share

Primary Sidebar

Categories

Category RSS Feeds

  • Calls & Consultations
  • Clinical Trials
  • Funding
  • Grey Literature
  • Guidelines Plus
  • History
  • Infographics
  • Journal Article Abstracts
  • Meta-analyses - Systematic Reviews
  • Monographs & Edited Collections
  • News
  • Open Access Journal Articles
  • Podcasts
  • Video

© 1993-2025 Dr. Gary Holden. All rights reserved.

gary.holden@nyu.edu
@Info4Practice