Locating minimal sets using polyhedral cones

DOI10.1016/J.ORL.2011.08.004zbMath1252.90077OpenAlexW1995126718MaRDI QIDQ408446

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)

Related Items (1)

A Survey of Set Optimization Problems with Set Solutions

Cites Work

• Unnamed Item
• New order relations in set optimization
• Nonconvex scalarization in set optimization with set-valued maps
• Some equivalent problems in set optimization
• Order-preserving transformations and applications
• Existence theorems for set optimization problems
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• Set-relations and optimality conditions in set-valued maps
• Existence theorems of set optimization with set-valued maps

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