{
 "id": "epetqs2ete",
 "slug": "bilevel-optimization",
 "title": "Bilevel optimization",
 "updated": "2026-10-15",
 "topic_path": [
  {
   "id": "physical",
   "label": "Physical world and mathematics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical"
  },
  {
   "id": "physical.math",
   "label": "Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/topics/physical.math"
  }
 ],
 "geo": [
  {
   "id": "geo.nongeo.t1800.physical.math",
   "label": "Non-geographic · 1800 to 1945: Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1800",
     "label": "Non-geographic · 1800 to 1945",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800"
    },
    {
     "id": "geo.nongeo.t1800.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical"
    },
    {
     "id": "geo.nongeo.t1800.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1800.physical.math"
    }
   ]
  },
  {
   "id": "geo.nongeo.t1946.physical.math",
   "label": "Non-geographic · 1946 to 2000: Mathematics and statistics",
   "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math",
   "path": [
    {
     "id": "geo.nongeo",
     "label": "Non-geographic",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo"
    },
    {
     "id": "geo.nongeo.t1946",
     "label": "Non-geographic · 1946 to 2000",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946"
    },
    {
     "id": "geo.nongeo.t1946.physical",
     "label": "Physical world and mathematics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical"
    },
    {
     "id": "geo.nongeo.t1946.physical.math",
     "label": "Mathematics and statistics",
     "api_url": "https://www.edgepedia.org/api/v1/geo/geo.nongeo.t1946.physical.math"
    }
   ]
  }
 ],
 "excerpt": "Bilevel optimization is a mathematical framework in which one optimization problem is nested inside another as a constraint, so the leader must anticipate the follower's best response, with applications in transportation, security, and machine learning.",
 "snippet": "Bilevel optimization is a mathematical framework in which one optimization problem is nested inside another as a constraint, so the leader must anticipate the follower's best response, with applications in transportation, security, and machine learning.",
 "node": "physical.math",
 "markdown": "# Bilevel optimization\n\nBilevel optimization is a mathematical framework in which one optimization problem is nested inside another as a constraint, so that solving the outer problem requires anticipating the optimal response of an inner problem. The outer decision-maker is called the leader and the inner one the follower; each has its own objective and constraints, and the leader's feasible set is determined by the follower's best response.<sup>[1](https://www.lamsade.dauphine.fr/poc/sites/default/files/bilevel-optimization.pdf)</sup><sup> • </sup><sup>[2](https://arxiv.org/html/2511.03448v1)</sup> This structure models hierarchical decision-making in which a decision-maker must anticipate stakeholder responses: transportation toll setting and network design, security planning, and, increasingly, machine learning tasks such as hyperparameter optimization and neural architecture search.<sup>[2](https://arxiv.org/html/2511.03448v1)</sup><sup> • </sup><sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup><sup> • </sup><sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup>\n\n| Key fact | Detail |\n|---|---|\n| Formal structure | The leader solves \\( \\min_{x} F(x,y) \\) subject to \\( y \\in S(x) \\), where \\( S(x) \\) is the set of optimal solutions of the follower's \\( x \\)-parameterized problem.<sup>[1](https://www.lamsade.dauphine.fr/poc/sites/default/files/bilevel-optimization.pdf)</sup> |\n| Two readings | When the follower has several optimal solutions the problem is ill-posed; the optimistic (weak) and pessimistic (strong) formulations resolve this differently.<sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup><sup> • </sup><sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup> |\n| Complexity | Even the linear case is strongly NP-hard, so polynomial-time exact algorithms are not expected unless P = NP.<sup>[5](https://doi.org/10.1287/opre.38.3.556)</sup><sup> • </sup><sup>[6](https://doi.org/10.1137/0913069)</sup><sup> • </sup><sup>[7](https://optimization-online.org/wp-content/uploads/2021/01/8187.pdf)</sup> |\n| Main reductions | Replacing the follower by its KKT conditions yields a mathematical program with equilibrium constraints (MPEC), possible only when the lower level is convex.<sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup><sup> • </sup><sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup> |\n| Gradient-based solving | The hypergradient combines an explicit gradient with an implicit gradient obtained by differentiating the follower's solution map.<sup>[8](https://proceedings.mlr.press/v247/chen24a/chen24a.pdf)</sup> |\n| Machine learning uses | Hyperparameter optimization, meta-learning, and architecture search are all naturally bilevel.<sup>[9](https://proceedings.mlr.press/v80/franceschi18a.html)</sup><sup> • </sup><sup>[10](https://doi.org/10.48550/arxiv.1806.09055)</sup> |\n\n## How it works\n\nA bilevel problem is written as \\( \\min_{x \\in X, y} F(x,y) \\) subject to \\( G(x) \\le 0 \\) and \\( y \\in \\Psi(x) \\), where \\( \\Psi(x) := \\{ y \\in Y: g(x,y) \\le 0,\\ f(x,y) \\le \\varphi(x) \\} \\) is the solution set mapping of the lower-level problem and \\( \\varphi(x) := \\min_y \\{ f(x,y): g(x,y) \\le 0,\\ y \\in Y \\} \\) is its optimal value function.<sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup> The constraint \\( (x,y) \\in \\mathrm{gph}\\,\\Psi \\) is the rational-response condition: the follower, seeing \\( x \\), plays a best reply, and the leader optimizes over the resulting pairs.\n\nIf the lower level has a unique optimal solution for every \\( x \\), the bilevel problem is equivalent to a single-level problem with an implicitly defined objective.<sup>[11](https://link.springer.com/book/10.1007/b101970)</sup> When \\( \\Psi(x) \\) is not a singleton, the map \\( x \\mapsto F(x, y(x)) \\) is multivalued and the problem is ill-posed; the optimistic approach assumes the follower picks the leader's preferred best reply, while the pessimistic approach bounds the damage from the worst one.<sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup> The framework formalizes the leader–follower game associated with Heinrich von Stackelberg's work on market equilibrium.<sup>[12](https://doi.org/10.2307/2550609)</sup>\n\n## How it is done\n\n**Single-level reductions.** Under appropriate differentiability and constraint-qualification assumptions, the Karush–Kuhn–Tucker (KKT) conditions characterize global lower-level optima when the lower level is convex, and replacing the lower level by these conditions produces a mathematical program with equilibrium (or complementarity) constraints, an MPEC or MPCC; for nonconvex lower levels the KKT conditions are generally only necessary, not sufficient for global optimality.<sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup><sup> • </sup><sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup> This MPEC is nonconvex and the Mangasarian–Fromovitz constraint qualification is violated at every feasible point, which shapes the specialized algorithms used for it.<sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup>\n\n**Discrete and combinatorial methods.** For linear bilevel problems, the solution occurs at a vertex of the underlying polyhedral set, which motivates vertex-enumeration algorithms; such methods may need to visit an exponential number of vertices in the worst case.<sup>[13](https://onlinelibrary.wiley.com/doi/10.1002/nav.3800310104)</sup><sup> • </sup><sup>[7](https://optimization-online.org/wp-content/uploads/2021/01/8187.pdf)</sup> Branch-and-bound and branch-and-cut schemes, and links to mixed 0–1 programming, form the second classical family.<sup>[14](https://doi.org/10.1023/a:1022645805569)</sup><sup> • </sup><sup>[7](https://optimization-online.org/wp-content/uploads/2021/01/8187.pdf)</sup> Evolutionary approaches such as genetic algorithms and particle swarm optimization handle instances lacking convexity or differentiability.<sup>[2](https://arxiv.org/html/2511.03448v1)</sup>\n\n**Gradient-based methods.** In machine learning the hypergradient of the outer objective, defined as \\( \\Phi(x) := F(x, y^{*}(x)) \\), decomposes, when the lower level is strongly convex and the solution map \\( y^{*} \\) is differentiable under suitable smoothness and regularity conditions, as \\( \\nabla \\Phi(x) = \\nabla_{x} F(x, y^{*}(x)) + (\\nabla y^{*}(x))^{\\top} \\nabla_{y} F(x, y^{*}(x)) \\): an explicit gradient plus an implicit gradient.<sup>[8](https://proceedings.mlr.press/v247/chen24a/chen24a.pdf)</sup> Because the Jacobians and inverse Hessians this formula involves cannot be computed explicitly, methods divide into approximate implicit differentiation (AID) and iterative differentiation (ITD) families.<sup>[15](https://www.jmlr.org/papers/volume24/21-0949/21-0949.pdf)</sup>\n\n## Origin\n\nThe class of optimization problems whose constraints themselves contain optimization problems, including certain games, was introduced by Jerome Bracken and James T. McGill in Operations Research in 1973; the paper gave convexity theory, a linear-programming application, and computational methods.<sup>[16](https://doi.org/10.1287/opre.21.1.37)</sup> A 1974 companion paper covered defense applications, and the formulation was first used for a military problem on the cost-minimal mix of weapons.<sup>[17](https://doi.org/10.1287/opre.22.5.1086)</sup><sup> • </sup><sup>[1](https://www.lamsade.dauphine.fr/poc/sites/default/files/bilevel-optimization.pdf)</sup> Jonathan F. Bard developed first-order necessary optimality conditions for the general problem in 1984 and showed the linear case is equivalent to maximizing a linear function over connected faces and edges of the polyhedral constraint set, with the solution at a vertex.<sup>[13](https://onlinelibrary.wiley.com/doi/10.1002/nav.3800310104)</sup> Omar Ben-Ayed and Charles E. Blair proved in 1990 that solving bilevel linear programs is NP-hard and that two previously published algorithms were only heuristics.<sup>[5](https://doi.org/10.1287/opre.38.3.556)</sup> Pierre Hansen, Brigitte Jaumard, and Gilles Savard established strong [NP-hardness](https://www.edgepedia.org/np-hardness) in 1992 by reduction from the graph problem KERNEL and introduced new branch-and-bound rules.<sup>[6](https://doi.org/10.1137/0913069)</sup> Audet, Hansen, Jaumard, and Savard linked linear bilevel and mixed 0–1 programming in 1997.<sup>[14](https://doi.org/10.1023/a:1022645805569)</sup> Stephan Dempe's Foundations of Bilevel Programming (2002) treats bilevel problems whose upper-level constraints are defined in part by a second parametric optimization problem, and Benoît Colson, Patrice Marcotte, and Gilles Savard's 2007 survey connected the field to MPECs.<sup>[11](https://link.springer.com/book/10.1007/b101970)</sup><sup> • </sup><sup>[18](https://doi.org/10.1007/s10479-007-0176-2)</sup>\n\n## Variants\n\nThe optimistic formulation lets the follower choose a best reply favorable to the leader; the pessimistic formulation solves \\( \\min_{x \\in X} \\varphi_p(x) := \\max_y \\{ F(x,y) \\mid y \\in S(x) \\} \\), a problem regarded as among the most challenging in bilevel optimization.<sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup><sup> • </sup><sup>[19](https://ar5iv.labs.arxiv.org/html/1711.11127)</sup> Selection-function approaches generalize both.<sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup> In the simple bilevel problem, a convex function is minimized over the solution set of another convex problem; unlike the general bilevel problem, which is nonconvex even with convex data, this variant is convex.<sup>[20](https://ar5iv.labs.arxiv.org/html/1912.06376)</sup>\n\n## Applications\n\nIn operations research, bilevel models set optimal tolls in transportation networks, design networks, and control traffic signals; security applications include border security, defense against terror attacks, and protection of critical infrastructure.<sup>[4](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)</sup><sup> • </sup><sup>[2](https://arxiv.org/html/2511.03448v1)</sup>\n\nIn machine learning, Luca Franceschi, Paolo Frasconi, Saverio Salzo, Riccardo Grazzi, and Massimiliano Pontil introduced a bilevel framework in 2018 unifying gradient-based hyperparameter optimization and meta-learning, solving an approximate bilevel problem that accounts explicitly for the inner objective's optimization dynamics.<sup>[9](https://proceedings.mlr.press/v80/franceschi18a.html)</sup><sup> • </sup><sup>[21](https://doi.org/10.48550/arxiv.1806.04910)</sup> DARTS, the [differentiable architecture search](https://www.edgepedia.org/differentiable-architecture-search) method of Hanxiao Liu, Karen Simonyan, and Yiming Yang (2018), uses gradient-based bilevel optimization over a continuous relaxation of the discrete architecture space.<sup>[10](https://doi.org/10.48550/arxiv.1806.09055)</sup>\n\n**Recent algorithmic theory.** Fully first-order methods now avoid Hessian-vector products: F2BA achieves \\( \\tilde{O}(\\bar{\\kappa}_y^{4} \\varepsilon^{-2}) \\) oracle complexity for nonconvex-strongly-convex bilevel problems, later improved to \\( \\tilde{O}(\\bar{\\kappa}_y^{7/2} \\varepsilon^{-2}) \\), which is near-optimal in \\( \\varepsilon \\) but leaves a provable gap in the condition-number dependence versus HVP-based \\( O(\\varepsilon^{-2}) \\) methods and against the \\( \\Omega(\\kappa^{3/2} \\varepsilon^{-2}) \\) deterministic lower bound.<sup>[22](https://jmlr.org/papers/volume26/23-1104/23-1104.pdf)</sup><sup> • </sup><sup>[8](https://proceedings.mlr.press/v247/chen24a/chen24a.pdf)</sup> Matching lower bounds have appeared: any first-order zero-respecting algorithm needs at least \\( \\Omega(\\kappa^{3/2} \\varepsilon^{-2}) \\) deterministic and \\( \\Omega(\\kappa^{5/2} \\varepsilon^{-4}) \\) stochastic oracle calls for an \\( \\varepsilon \\)-accurate stationary point, leaving substantial gaps against current upper bounds.<sup>[23](https://par.nsf.gov/biblio/10681833-lower-complexity-bounds-nonconvex-strongly-convex-bilevel-optimization-first-order-oracles)</sup>\n\n## Limitations and alternatives\n\n**Hardness.** Bilevel linear programming is NP-hard; the strong NP-hardness of even the linear case rules out polynomial-time exact algorithms unless P = NP.<sup>[5](https://doi.org/10.1287/opre.38.3.556)</sup><sup> • </sup><sup>[7](https://optimization-online.org/wp-content/uploads/2021/01/8187.pdf)</sup> When the lower level is convex but not strongly convex, finding stationary points of the hyper-objective can be intractable for zero-respecting algorithms.<sup>[8](https://proceedings.mlr.press/v247/chen24a/chen24a.pdf)</sup><sup> • </sup><sup>[22](https://jmlr.org/papers/volume26/23-1104/23-1104.pdf)</sup>\n\n**Structural failure modes.** Non-unique lower-level solutions make the problem ill-posed, requiring optimistic, pessimistic, or selection-function treatments.<sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup><sup> • </sup><sup>[11](https://link.springer.com/book/10.1007/b101970)</sup> Because complementarity constraints violate LICQ and MFCQ at all feasible points of an MPEC, KKT conditions may be invalid at minimizers and standard nonlinear-programming solvers lose their convergence guarantees; MPEC-tailored constraint qualifications address this.<sup>[24](https://eprints.soton.ac.uk/508837/1/2508.12850v1.pdf)</sup> Single-level reformulations of linear bilevel problems need big-M parameters that are hard to obtain and yield badly posed problems, and with a continuous nonconvex lower level, solving the follower only to \\( \\varepsilon \\)-feasibility can leave the returned solution arbitrarily far from the true one even under uniqueness, strict complementarity, and Slater's condition.<sup>[25](https://link.springer.com/article/10.1007/s10957-023-02238-9)</sup> Implicit-gradient methods require Hessian-vector products, which are hard to implement on large-scale distributed or neuromorphic hardware; equilibrium propagation, introduced by Benjamin Scellier and [Yoshua Bengio](https://www.edgepedia.org/yoshua-bengio) in 2017, avoids them by contrasting partial derivatives.<sup>[26](https://arxiv.org/pdf/2205.03076v3.pdf)</sup><sup> • </sup><sup>[27](https://doi.org/10.3389/fncom.2017.00024)</sup> More broadly, real implementations remain scarce for medium- and large-scale instances, and no general method guarantees convergence, performance, or optimality for every problem type.<sup>[3](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)</sup>\n\n**Nearest alternatives.** The MPEC is the closest single-level relative and is the standard reformulation rather than a competing framework; the simple bilevel problem offers a convex special case with dedicated algorithms; and the pessimistic variant, where little has long been known, remains the least developed branch.<sup>[28](http://ideas.repec.org/h/spr/spochp/978-3-030-52119-6_12.html)</sup><sup> • </sup><sup>[20](https://ar5iv.labs.arxiv.org/html/1912.06376)</sup><sup> • </sup><sup>[19](https://ar5iv.labs.arxiv.org/html/1711.11127)</sup> How bilevel optimization compares in detail with robust optimization, and the specifics of adversarial-training applications, are not settled by the published comparisons covered here.\n\n## References\n\n1. [A Gentle and Incomplete Introduction to Bilevel Optimization (lecture notes, LAMSADE)](https://www.lamsade.dauphine.fr/poc/sites/default/files/bilevel-optimization.pdf)\n2. [A Review of Bilevel Optimization: Methods, Emerging Applications, and Recent Advancements](https://arxiv.org/html/2511.03448v1)\n3. [Bilevel Programming and Applications (Wiley, 2015)](https://onlinelibrary.wiley.com/doi/10.1155/2015/310301)\n4. [Bilevel optimization: theory, algorithms and applications (S. Dempe, survey/annotated bibliography)](https://optimization-online.org/wp-content/uploads/2018/08/6773.pdf)\n5. [Omar Ben-Ayed, Charles E. Blair (1990). Computational Difficulties of Bilevel Linear Programming. Operations Research.](https://doi.org/10.1287/opre.38.3.556)\n6. [Pierre Hansen, Brigitte Jaumard, Gilles Savard (1992). New Branch-and-Bound Rules for Linear Bilevel Programming. SIAM Journal on Scientific and Statistical Computing.](https://doi.org/10.1137/0913069)\n7. [A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization](https://optimization-online.org/wp-content/uploads/2021/01/8187.pdf)\n8. [On Finding Small Hyper-Gradients in Bilevel Optimization: Hardness Results and Improved Analysis (PMLR v247)](https://proceedings.mlr.press/v247/chen24a/chen24a.pdf)\n9. [Bilevel Programming for Hyperparameter Optimization and Meta-Learning (Franceschi et al., ICML 2018)](https://proceedings.mlr.press/v80/franceschi18a.html)\n10. [Liu, Hanxiao, Simonyan, Karen, Yang, Yiming (2018). DARTS: Differentiable Architecture Search. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.1806.09055)\n11. [Foundations of Bilevel Programming (Stephan Dempe, Springer, 2002)](https://link.springer.com/book/10.1007/b101970)\n12. [Heinrich von Stackelberg and colleagues (1953). The Theory of the Market Economy.. Economica.](https://doi.org/10.2307/2550609)\n13. [Optimality conditions for the bilevel programming problem (Bard, Naval Research Logistics Quarterly, 1984)](https://onlinelibrary.wiley.com/doi/10.1002/nav.3800310104)\n14. [C. Audet and colleagues (1997). Links Between Linear Bilevel and Mixed 0–1 Programming Problems. Journal of Optimization Theory and Applications.](https://doi.org/10.1023/a:1022645805569)\n15. [Lower Bounds and Accelerated Algorithms for Bilevel Optimization (JMLR)](https://www.jmlr.org/papers/volume24/21-0949/21-0949.pdf)\n16. [Jerome Bracken, James T. McGill (1973). Mathematical Programs with Optimization Problems in the Constraints. Operations Research.](https://doi.org/10.1287/opre.21.1.37)\n17. [Jerome Bracken, James T. McGill (1974). Defense Applications of Mathematical Programs with Optimization Problems in the Constraints. Operations Research.](https://doi.org/10.1287/opre.22.5.1086)\n18. [Benoît Colson, Patrice Marcotte, Gilles Savard (2007). An overview of bilevel optimization. Annals of Operations Research.](https://doi.org/10.1007/s10479-007-0176-2)\n19. [Two-level value function approach to nonsmooth optimistic and pessimistic bilevel programs (Mordukhovich et al.)](https://ar5iv.labs.arxiv.org/html/1711.11127)\n20. [Simple Bilevel Programming and Extensions Part-I: Theory](https://ar5iv.labs.arxiv.org/html/1912.06376)\n21. [Franceschi, Luca and colleagues (2018). Bilevel Programming for Hyperparameter Optimization and Meta-Learning. arXiv (Cornell University).](https://doi.org/10.48550/arxiv.1806.04910)\n22. [Near-Optimal Nonconvex-Strongly-Convex Bilevel Optimization with Fully First-Order Oracles (JMLR)](https://jmlr.org/papers/volume26/23-1104/23-1104.pdf)\n23. [Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles (ICML 2026, NSF Public Access Repository record)](https://par.nsf.gov/biblio/10681833-lower-complexity-bounds-nonconvex-strongly-convex-bilevel-optimization-first-order-oracles)\n24. [On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning](https://eprints.soton.ac.uk/508837/1/2508.12850v1.pdf)\n25. [On a Computationally Ill-Behaved Bilevel Problem with a Continuous and Nonconvex Lower Level (JOTA, 2023)](https://link.springer.com/article/10.1007/s10957-023-02238-9)\n26. [Beyond backpropagation: bilevel optimization through implicit differentiation and equilibrium propagation](https://arxiv.org/pdf/2205.03076v3.pdf)\n27. [Benjamin Scellier, Yoshua Bengio (2017). Equilibrium Propagation: Bridging the Gap between Energy-Based Models and Backpropagation. Frontiers in Computational Neuroscience.](https://doi.org/10.3389/fncom.2017.00024)\n28. [MPEC Methods for Bilevel Optimization Problems (Kim, Leyffer, Munson, 2020, Springer)](http://ideas.repec.org/h/spr/spochp/978-3-030-52119-6_12.html)\n\n---\n*Topic: Encyclopedia › Physical world and mathematics › Mathematics and statistics*\n\n*Initially written Sep 29, 2026 · Edited: Oct 15, 2026*\n\n*Copyright 2026 EdgeChat AI, a subsidiary of Biostate AI.*\n\nLicense: Edgepedia Community License 1.0, https://www.edgepedia.org/edgepedia/license\n",
 "same_as": [],
 "url": "https://www.edgepedia.org/bilevel-optimization",
 "markdown_url": "https://www.edgepedia.org/bilevel-optimization.md",
 "license": {
  "name": "Edgepedia Community License 1.0",
  "url": "https://www.edgepedia.org/edgepedia/license",
  "summary": "Free with credit, commercial use included. AI training is open to everyone. For other uses, organizations over USD 100M in revenue or 100M monthly users license separately.",
  "spdx": "LicenseRef-Edgepedia-Community-1.0"
 },
 "credit": "\"Bilevel optimization\", Edgepedia (EdgeChat), https://www.edgepedia.org/bilevel-optimization. Edgepedia Community License 1.0.",
 "credit_md": "\"[Bilevel optimization](https://www.edgepedia.org/bilevel-optimization)\", Edgepedia (EdgeChat), [https://www.edgepedia.org/bilevel-optimization](https://www.edgepedia.org/bilevel-optimization). [Edgepedia Community License 1.0](https://www.edgepedia.org/edgepedia/license).",
 "credit_html": "\"<a href=\"https://www.edgepedia.org/bilevel-optimization\">Bilevel optimization</a>\", Edgepedia (EdgeChat), <a href=\"https://www.edgepedia.org/bilevel-optimization\">https://www.edgepedia.org/bilevel-optimization</a>. <a href=\"https://www.edgepedia.org/edgepedia/license\">Edgepedia Community License 1.0</a>.",
 "speakable": "Bilevel optimization is a mathematical framework in which one optimization problem is nested inside another as a constraint, so the leader must anticipate the follower's best response, with applications in transportation, security, and machine learning."
}