Koc University Digital Collections
metadata only
Bilevel programming for generating discrete representations in multiobjective optimization
The solution to a multiobjective optimization problem consists of the nondominated set that portrays all relevant trade-off information. The ultimate goal is to identify a Decision Maker's most preferred solution without generating the entire set of nondominated solutions. We propose a bilevel progr
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
- Expected Hypervolume Maximization for Multiobjective Optimization under Uncertainties#1014905
- Tradeoff directions in multiobjective optimization problems#430007
- Unweighted ranking for value-based decision making with uncertainty#180703
- Multi-objective production planning of new and remanufactured products in hybrid production system#643342
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
Record · ID 955430
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