arXiv (All)
open access
On the Tightness of Standard Relaxations for Mixed-Integer Bilevel Linear Programs
Exact algorithms for solving mixed-integer bilevel linear programs (MIBLPs) typically rely on sequences of lower and upper bounds that converge to the optimal value. These procedures are commonly initialized using the single-level relaxation (SLR), obtained by omitting the follower's optimality cond
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
- On coupling constraints in linear bilevel optimization#796343
- S$^3$LDBO: A Snapshot Single-Loop Algorithm for Decentralized Bilevel Optimization#246538
- A Review of Bilevel Optimization: Methods, Emerging Applications, and Recent Advancements#1117272
- On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis#177681
- On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis#177201
Record · ID 997133
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