Simple Bilevel Programming

• Simple bilevel programming is a hierarchical optimization model where an upper-level decision-maker optimizes an objective subject to the follower’s optimal reaction from a lower-level problem.
• It employs various reformulations such as KKT conditions, Wolfe-dual transformations, and VI-based approaches to manage nonuniqueness, well-posedness, and computational challenges.
• Recent algorithmic advances and implementation tools like BilevelJuMP demonstrate progress in tackling the inherent NP-hardness and complexity of these models.

Simple bilevel programming denotes a class of hierarchical optimization problems in which upper-level feasibility or upper-level performance is determined by the optimal solution set of a lower-level problem. In one common formulation, the leader chooses $x$ and anticipates the follower’s optimal reaction $y$, producing the familiar Stackelberg structure. In another common formulation, especially in convex analysis and modern first-order optimization, one minimizes an upper-level function over the optimal solution set of a lower-level convex problem, often with a common decision variable or a shared feasible set (Garcia et al., 2022, Cao et al., 2024). Across these uses, the defining feature is the embedding of lower-level optimality as a constraint, which immediately raises questions of well-posedness, reformulation, optimality theory, and computational tractability (Som et al., 23 Oct 2025).

1. Canonical formulations and scope

In the leader–follower formulation, a general optimistic bilevel program has the form

$$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$

A standard linear bilevel form is

$$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$

This viewpoint models pricing and toll-setting, strategic bidding in electricity markets, facility location with customer choice, and machine-learning hyperparameter tuning (Garcia et al., 2022).

A second line of work uses “simple bilevel optimization” for problems of the form

$$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$

or, in the notation of simple bilevel programming and simple mathematical programming with equilibrium constraints,

$$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$

This same-variable formulation is closely related to variational inequalities: if $F=\nabla h$, then

$$S=\operatorname{sol}(\mathrm{VI}(F,C)) :=\{x\in C:\langle F(x),y-x\rangle\ge 0\ \forall y\in C\},$$

so simple bilevel programming appears as a special case of simple MPEC/VI-constrained optimization (Dempe et al., 2019).

In composite convex settings, the upper and lower objectives may each be split into a smooth convex term and a prox-friendly convex term,

$f(x)=f_1(x)+f_2(x),\qquad g(x)=g_1(x)+g_2(x),$

with the lower-level solution set $S^*=\arg\min g$ and upper-level problem $y$0. This formulation is used for machine learning, inverse problems, and lexicographic optimization (Jiang et al., 2024).

2. Well-posedness, nonuniqueness, and solution concepts

The central modeling difficulty is nonuniqueness of the lower-level solution map

$y$1

If $y$2 has multiple points, then the upper-level value depends on which lower-level optimizer is selected. The optimistic and pessimistic remedies are

$y$3

If value attainment holds, these become minimum and maximum over $y$4 (Som et al., 23 Oct 2025).

The same paper develops a set-valued viewpoint in which the leader optimizes the image set

$y$5

ordered by lower and upper set orders. In this framework, $y$6-minimal solutions recover real optimistic solutions and $y$7-minimal solutions recover real pessimistic solutions. The paper’s main finding is that, in the general case without value attainment and closedness assumptions, the set-valued formulation “may not hold any bigger advantage than the existing optimistic and pessimistic formulation” (Som et al., 23 Oct 2025).

Several regularity hypotheses govern whether these formulations coincide. Strict convexity of $y$8 on $y$9 can make $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$0 singleton. Continuity of $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$1 and compactness of $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$2 give value attainment, so $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$3. Outer semicontinuity and closedness of $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$4 are relevant for stability. Under Berge-type conditions—continuous $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$5, continuous compact-valued $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$6, and lower semicontinuous $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$7—real and standard optimistic formulations coincide locally and globally (Som et al., 23 Oct 2025).

The cited examples show that the distinctions are substantive. One example has $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$8 and $$\min_{x \in X,\, y} \; F(x,y) \quad \text{s.t. } G(x,y) \le 0,\; H(x,y)=0,\; y \in \arg\min_{y} \{\, f(x,y) : g(x,y) \le 0,\; h(x,y)=0 \,\}.$$9, so $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$0 for all $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$1, but the infimum is not attained; hence every $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$2 is real optimistic, while no standard optimistic pair exists. Another example shows that real optimistic and $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$3-minimal solutions can diverge if the value sets $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$4 are not closed (Som et al., 23 Oct 2025).

3. Reformulations and optimality theory

For convex lower-level problems satisfying appropriate constraint qualifications, the lower level can be replaced by Karush–Kuhn–Tucker conditions. For

$$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$5

the KKT system introduces multipliers $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$6 and $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$7: $$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$8

$$\min_{x,y} \; c^\top x + d^\top y \quad \text{s.t. } A x + B y \le b,\; y \in \arg\min_{y} \{\, q^\top y : G y \ge h + K x,\; y \ge 0 \,\}.$$9

In linear and conic cases, the paper on BilevelJuMP also notes strong-duality alternatives, in which primal and dual feasibility plus equality of primal and dual objective values replace many complementarity relations (Garcia et al., 2022).

A different single-level route replaces KKT complementarity by a Wolfe-dual reformulation. Under pseudoconvexity of the lower-level Lagrangian with respect to the follower’s decision and Guignard CQ at a lower-level optimal solution, the bilevel program is globally and locally equivalent to a single-level reformulation denoted WDP. A notable distinction is that, unlike the MPEC reformulation, WDP may satisfy the Mangasarian–Fromovitz constraint qualification at feasible points (Li et al., 2023).

In the VI-based theory of simple bilevel programming and simple MPEC, the lower level is represented through the dual gap function

$$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$0

For continuous monotone $$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$1 and compact convex $$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$2,

$$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$3

so SMPEC becomes a nonsmooth simple bilevel problem and also a single-level convex program

$$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$4

This framework yields KKT-type conditions under closedness qualifications, weak-BCQ conditions, calmness-based conditions, and sequential optimality conditions that do not require any constraint qualification (Dempe et al., 2019).

For optimistic smooth bilevel problems, first- and second-order sufficient optimality conditions can be expressed in terms of initial problem data by estimating the tangent cone to the bilevel feasible set and by using the value-function reformulation together with second-order directional derivatives. The resulting conditions are particularly explicit when the lower level is linear or when the lower-level solution is strongly stable (Mehlitz et al., 2019).

4. Algorithms and computational complexity

The computational landscape is sharply heterogeneous. On the negative side, bilevel linear programming remains hard even in highly restricted forms. The decision problem for rational bilevel LP with a single upper-level variable, no explicit upper-level constraints beyond follower optimality, and all variables bounded in $$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$5 is NP-complete. The same paper shows that no PTAS exists unless $$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$6, while many combinatorial problems, including knapsack and traveling salesman, can be encoded in that restricted model. At the same time, a polynomial-time algorithm exists for finding a locally optimal solution in that one-dimensional leader setting by exploiting the continuity and piecewise-linearity of the leader’s partial value function (Sugishita et al., 24 Oct 2025).

For polynomial data, exact global optimization is possible in special classes. Simple bilevel polynomial programs can be reformulated as semi-infinite polynomial programs using Fritz John conditions and Jacobian representations, and then attacked by an exchange technique combined with Lasserre-type semidefinite relaxations. For simple BPPs, the paper proves convergence to global optimal solutions (Nie et al., 2015).

Recent first-order work on convex simple bilevel optimization emphasizes weakly or approximately feasible solutions rather than exact global optimality. The main complexity statements in the cited papers are summarized below.

Method	Setting	Stated complexity
CG-BiO	Smooth lower level; convex upper level	$$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$7 (Jiang et al., 2022)
AGM-BiO	Convex smooth upper and lower levels; compact $$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$8	$$\min_x f(x) \quad \text{s.t.}\quad x\in \operatorname*{argmin}_{z\in \mathcal Z} g(z),$$9 (Cao et al., 2024)
BiVFA	Convex composite setting under weak assumptions	$$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$0 (Jiang et al., 2024)
FC-BiO	Convex smooth or Lipschitz setting, weak solutions	smooth: $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$1; Lipschitz: $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$2 (Zhang et al., 2024)

These methods rely on distinct mechanisms. CG-BiO approximates the lower-level solution set by a cutting plane and uses conditional-gradient updates (Jiang et al., 2022). AGM-BiO keeps the cutting-plane idea but replaces Frank–Wolfe steps with accelerated projected steps and obtains $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$3 upper-level suboptimality (Cao et al., 2024). BiVFA reformulates the problem as finding the left-most root of $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$4, uses a bisection on the upper-level budget, and solves each constrained lower-level subproblem by a dual APG routine (Jiang et al., 2024). FC-BiO proves that absolute approximation of the outer value is impossible for first-order zero-respecting algorithms in general convex settings, then targets weak $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$5-solutions through a functionally constrained reformulation and bisection on a scalar threshold (Zhang et al., 2024).

Other algorithmic lines relax the standard smoothness assumptions further. A recent Armijo–projection scheme solves

$$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$6

uses an Armijo backtracking step to update a lower-level bound $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$7, and then solves

$$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$8

It requires no differentiability of the upper-level objective and no Lipschitz continuity of the lower-level gradient; cluster points are bilevel-optimal under the paper’s assumptions (Dempe et al., 16 Apr 2025). Earlier proximal penalization algorithms for nonsmooth simple bilevel problems and simple MPECs use $$\min_x f(x)\quad\text{subject to}\quad x\in S, \qquad S=\operatorname*{argmin}\{h(x):x\in C\}.$$9-subdifferentials, $F=\nabla h$0-normal cones, and dual gap penalties $F=\nabla h$1, with convergence expressed as $F=\nabla h$2 (Dempe et al., 2019).

For more general weakly convex formulations, the Moreau-envelope-based reformulation

$F=\nabla h$3

produces a single-level difference-of-weakly-convex problem. The associated iP-DwCA algorithm solves proximal lower-level subproblems, linearizes the envelope term through sensitivity information, and converges to KKT points of the reformulated problem under the paper’s assumptions (Gao et al., 2023).

5. Modeling systems, software, and differentiable implementations

A major practical development is the Julia package "BilevelJuMP.jl" (Garcia et al., 2022). It allows both levels to be described in JuMP syntax inside one BilevelModel, using Upper(model) and Lower(model) contexts. The upper level supports all JuMP constraint classes, including linear, quadratic, nonlinear, conic, and integer constraints. The lower level supports convex conic constraints, including linear and quadratic lower levels. The package then generates single-level MPEC reformulations through MathOptInterface.jl and Dualization.jl, and exposes several complementarity-handling modes: SOS1Mode, IndicatorMode, FortunyAmatMcCarlMode, ProductMode, ComplementMode, MixedMode, and StrongDualityMode. It interfaces with off-the-shelf MILP, MISOCP, conic, QP, NLP, and specialized MPEC solvers, and also exposes lower-level dual variables through DualOf, which is useful in market models (Garcia et al., 2022).

Differentiable bilevel programming has also entered machine learning workflows. BiGrad treats a bilevel optimization program as an implicit layer and differentiates through it end-to-end. For continuous lower-level problems, it uses implicit differentiation and vector–Jacobian products, solving adjoint linear systems rather than explicitly inverting Hessians. For combinatorial lower levels, it provides perturb-then-solve and straight-through gradient estimators, so the framework applies to both continuous and combinatorial bilevel optimization problems (Alesiani, 2023).

In linear bilevel power-system models, a different implementation strategy uses decision trees to predict the active constraints of the lower-level LP. The predicted active set is then imposed as equalities, inactive duals are set to zero, and the resulting reduced single-level problem is solved as a continuous LP. In the generator strategic bidding problem with a DCOPF lower level, the methods avoid binaries and big-$F=\nabla h$4 constants and are heuristic, so they do not provide guarantees of optimality or solution quality, but they substantially reduce online solution times and make previously intractable cases solvable in practice (Prat et al., 2020).

6. Applications, practical issues, and interpretation

The application range is broad but structurally coherent. The Stackelberg interpretation covers pricing and toll-setting, electricity-market strategic bidding, and industrial-organization examples such as Stackelberg duopoly (Garcia et al., 2022, Som et al., 23 Oct 2025). In convex same-variable formulations, simple bilevel programming appears in hyperparameter selection, sparse regression, support vector regression, kernel SVM tuning, distance-to-solution-set estimation, and portfolio selection (Jiang et al., 2024, Dempe et al., 16 Apr 2025). The cited literature also connects optimistic and pessimistic bilevel models to robust optimization, and identifies the obstacle problem in PDE-constrained optimization as a bilevel setting with infinite-dimensional lower-level space (Som et al., 23 Oct 2025).

Several practical prescriptions recur across the sources. If possible, uniqueness of the lower-level response should be enforced through strict or strong convexity, because this removes the optimistic–pessimistic ambiguity. If uniqueness is unavailable, the model should specify whether the follower is assumed cooperative or adversarial, or whether an explicit tie-breaking rule is imposed; this choice changes the meaning of the problem, not merely the algorithm (Som et al., 23 Oct 2025). In computational implementations based on KKT or MPEC reformulations, big-$F=\nabla h$5 values require realistic bounds, scaling matters, complementarity conditions are numerically delicate, and conic or nonlinear lower levels often favor strong-duality or product-based formulations rather than naive MILP encodings (Garcia et al., 2022).

The word “simple” is therefore potentially misleading. In restricted convex settings, near-optimal first-order complexity is achievable for weak solution notions, and several algorithms match single-level rates up to logarithmic factors (Cao et al., 2024, Zhang et al., 2024). Yet even very stripped-down linear bilevel models remain NP-complete, and exact global computation is generally difficult (Sugishita et al., 24 Oct 2025). The set-valued perspective clarifies why this is not merely an algorithmic accident: without value attainment, closedness, compactness, or uniqueness, the object being optimized may itself be ambiguous (Som et al., 23 Oct 2025).

Simple bilevel programming is thus best understood not as an intrinsically easy subclass, but as a family of hierarchical models whose mathematical behavior depends sharply on lower-level regularity, solution multiplicity, and representational choice. The modern literature shows that progress comes from making those structural assumptions explicit—whether through optimistic or pessimistic semantics, gap-function and value-function reformulations, strong-duality reductions, or first-order weak-solution frameworks—and then tailoring the algorithmic machinery to that structure.