SOURCE-LINKED INTELLIGENCE

Disciplined Bilevel Programming

arXiv · AI, language, vision and robotics · article · Sep 1, 2026 · UTC

Bilevel optimization provides a natural modeling language for hierarchical decision problems. However, applying existing numerical solvers usually requires substantial manual analysis and reformulation. In this paper, we introduce disciplined bilevel programming (DBLP), a symbolic framework that allows users to specify and solve optimistic bilevel problems in a high-level, human-readable way that is close to the mathematical formulation. For problems with a disciplined nonlinear upper problem and a convex lower problem satisfying the disciplined parameterized programming rules, DBLP automatica

Read original source ↗ Open in workspace

recordType

paper

region

Global