arXiv (All)
open access
Pareto optimality under nondegeneracy at infinity
In this paper, we consider a broad class of multiobjective optimization problems, which are defined in a simple and elegant manner by using only two basic notions of Newton polyhedra and nondegeneracy at infinity associated with given data. For each problem in the class, its several basic properties
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
- Approches exactes pour les problèmes d'optimisation combinatoire multi-objectifs#1345875
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
- A bicriteria approach identifying nondominated portfolios#948410
- Large-Scale Portfolio Optimization Problem Under Cardinality Constraint With Enhanced Multi-Objective Evolutionary Algorithms#361491
- Learning Fair Pareto-Optimal Policies in Multi-Objective Reinforcement Learning#282786
Record · ID 1389929
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