arXiv (All)
open access
Representing the Non-dominated Set of Multi-objective Optimization Problems with Polyhedral Ordering Cones
In the literature, research on representing the non-dominated set has focused almost exclusively on multi-objective optimization problems with Pareto-dominance. However, general ordering cones are used to incorporate preferences of decision makers into the optimization process and to model other spe
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
- Approches exactes pour les problèmes d'optimisation combinatoire multi-objectifs#1345875
- A bicriteria approach identifying nondominated portfolios#948410
- Modified Polyhedral Method to Elicit Shape-Free Utility and Reduction of Conservatism in Robust Optimization#1326099
- A Unified Information-Theoretic Approach to Constrained Multi-Fidelity Multi-Objective Bayesian Optimization#1234541
Record · ID 1297493
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive