arXiv (All)
open access
On solving integer bilevel optimization problems with a non-convex quadratic follower objective function using disjunctive cuts
In this work, we study bilevel optimization problems where all variables are integer, all constraints and the leader objective function are linear, and the follower objective function is non-convex quadratic. Relying on bilevel-free sets derived from improving directions, we develop a disjunctive cu
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
- Sufficient optimality conditions in bilevel programming#196253
- Diversification-driven tabu search for unconstrained binary quadratic problems#235243
- Envelopt: Constrained Convex Composite Optimization#1077449
- A connectedness result for convex polynomial multi-objective optimization without boundedness#1155964
- Learning Fair Pareto-Optimal Policies in Multi-Objective Reinforcement Learning#282786
Record · ID 1156469
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