Locating minimal sets using polyhedral cones

DOI10.1016/J.ORL.2011.08.004MaRDI QIDQ408446zbMATH OpenOpenAlexFDO

Authors Elvira Hernández, Luis Rodríguez-Marín

Publication date 5 April 2012

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2011.08.004

zbMATH Keywords

global optimizationlocalizationset optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Sets of efficient points in a normed space
• Minimality of convex sets equivalent on a cone
• Convergence of the efficient sets
• Structure of the Efficient Point Set
• On the existence of efficient points in locally convex spaces

Cites work

• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Existence theorems for set optimization problems
• Existence theorems of set optimization with set-valued maps
• scientific article; zbMATH DE number 2063780 (Why is no real title available?)
• New order relations in set optimization
• Nonconvex scalarization in set optimization with set-valued maps
• Order-preserving transformations and applications
• Set-relations and optimality conditions in set-valued maps
• Some equivalent problems in set optimization

Cited in

(3)

• Minimax equalities by reconstruction of polytopes
• A survey of set optimization problems with set solutions
• Minsum location extended to gauges and to convex sets

This page was built for publication: Locating minimal sets using polyhedral cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q408446)