.png){kind=icon}
.png){kind=icon}
Return
Local upper bounds based on polyhedral ordering cones
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejco.2025.100124.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Answers the question on the extentability of the concept of local lower and local upper bounds from the nonnegative orthant to arbitrary ordering cones. • Gives existence results and results on different characterization of local upper bound sets for arbitrary ordering cones. • Gives a simple way to calculate local lower bounds for polyhedral ordering cones (with a certain property). • And discusses the use for the concept of enclosures, a major tool within numerical algorithms for multiobjective optimization.
Keywords:
90C29
90C26
Multiobjective optimization
Local upper bound
Polyhedral ordering cone
Enclosure
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
1.7
Papers:
42
Citations:
391