Benders Cuts in Optimization

• Benders cuts are valid inequalities that decouple complicating variables from subproblems by approximating the recourse function in a lower-dimensional space.
• They are generated through dual solutions in classical linear settings or via inference in logic-based and generalized variants, ensuring precise master-subproblem communication.
• Advanced strategies such as cut strengthening, aggregation, and adaptive management enhance computational efficiency in applications like scheduling, network design, and stochastic optimization.

Benders cuts are valid inequalities that encode, in a master problem, the feasibility and value function of a subordinate optimization problem obtained after fixing the complicating variables. In classical Benders decomposition, the cuts are derived from the dual of a linear subproblem; in logic-based and generalized variants, they are derived from problem-specific inference, combinatorial structure, or conic duality. Across these settings, Benders cuts serve the same purpose: they iteratively reconstruct the epigraph or feasible domain of the recourse function in a lower-dimensional space, thereby coupling a reduced master problem to subproblem information without solving the full monolithic formulation at every step (Hooker, 2019).

1. Classical derivation and canonical forms

In the classical linear setting, Benders decomposition starts from a formulation of the form

$$\begin{aligned} \min_{x,y}\quad & c^\top x + d^\top y \ \text{s.t.}\quad & A x + B y \ge b,\ & x \in X,\quad y \in Y. \end{aligned}$$

The complicating variables $x$ remain in the master problem, while the continuous variables $y$ define a subproblem

$$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$

If the subproblem is a linear program, its dual has the form

$$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$

and an optimal dual solution $\pi^*$ yields a Benders optimality cut

$\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$

If the subproblem is infeasible, an extreme ray $\bar\pi$ of the dual yields a feasibility cut

$\bar\pi^\top(b-Ax)\le 0,$

which is equivalently written as

$\alpha+\beta^\top x \le 0.$

The master problem is therefore an optimization over $x$0 and recourse variable(s) $x$1, constrained by an accumulating family of such cuts (Donkiewicz et al., 28 Apr 2026).

This same structure can be written epigraphically. Let $x$2 denote the subproblem value function induced by the feasible set $x$3. Then the master works with $x$4 and the condition $x$5. In that language, a Benders cut is any valid inequality

$x$6

for $x$7, with $x$8 corresponding to a feasibility cut and $x$9 corresponding to an optimality cut (Ota et al., 26 Sep 2025).

A recurrent notation in recent work is to write each generated inequality generically as

$y$0

with violation at the current master solution $y$1 defined by

$y$2

That formulation is especially useful when many cuts are generated simultaneously and later filtered or aggregated (Donkiewicz et al., 28 Apr 2026).

2. Feasibility cuts, optimality cuts, and decomposition architectures

The fundamental distinction is between feasibility cuts, which exclude master solutions for which the subproblem has no feasible recourse, and optimality cuts, which tighten the lower approximation of recourse cost. In deterministic single-subproblem settings this distinction is direct. In scenario-based two-stage models, however, the architecture of cuts becomes a modeling choice.

For a finite scenario set $y$3, a standard multi-cut master introduces one recourse variable $y$4 per scenario and enforces

$y$5

for dual extreme points, together with scenario-wise feasibility cuts

$y$6

for dual rays. The single-cut alternative replaces the family $y$7 by a single $y$8 and aggregates the scenarios into one optimality cut. The multi-cut method yields stronger cuts and often fewer iterations, but enlarges the master rapidly; the single-cut method keeps the master small, but typically requires more iterations (Ramírez-Pico et al., 2022).

Disaggregation can also occur over dimensions other than scenarios. In network maintenance scheduling, the max-flow subproblem decomposes by time period, so one introduces $y$9 and one Benders cut per time period,

$$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$0

rather than a single aggregate throughput cut. The resulting cuts are stronger because each $$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$1 is bounded by the precise minimum-cut structure at time $$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$2 (Pearce et al., 2016).

Generalized Benders decomposition extends the same architecture to convex nonlinear subproblems. In the BESS siting and sizing problem, the master contains time-invariant siting and sizing variables $$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$3, while daily SOCP operational subproblems yield affine optimality cuts of the form

$$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$4

and feasibility cuts derived from a feasibility-check SOCP with slacks on the linking constraints (Larroux et al., 4 Mar 2026).

A common misconception is that Benders cuts behave like generic MIP cutting planes. In the scenario-flow setting, this is explicitly rejected: unlike ordinary solver cuts, Benders cuts are part of the correct formulation, and some violated cuts must eventually be added to preserve correctness and convergence (Donkiewicz et al., 28 Apr 2026).

3. Logic-based Benders cuts

Logic-based Benders decomposition replaces LP duality by an inference dual. For a fixed master solution $$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$5, the subproblem

$$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$6

has an inference dual that seeks the strongest bound provable from the subproblem constraints. The resulting logic-based cut has the generic form

$$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$7

where $$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$8 equals the subproblem optimum and $$Q(\bar x) := \min_y \{ d^\top y : B y \ge b - A\bar x,\ y\in Y\}.$$9 is valid for all $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$0. When the master variable domain is finite, finite convergence follows from the general LBBD theory (Hooker, 2019).

This framework is particularly useful when the subproblem is a scheduling model, a combinatorial optimization problem, or even a simulation. In the stochastic planning-and-scheduling setting, the master assigns jobs to facilities and the second stage is a CP scheduling problem. Simple nogood cuts forbid repeating an infeasible or suboptimal assignment pattern, while analytical cuts use release times, processing times, and tardiness structure to derive stronger lower bounds than standard integer L-shaped cuts (Elci et al., 2020).

In simulation-based stochastic resource allocation, the subproblem is a discrete-event simulation rather than an LP. The cuts are derived from monotonicity: if more resource cannot make performance worse, then simulation at $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$1 identifies critical periods and yields globally valid cuts of the form

$$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$2

or analogous variants for constraints. These are logic-based Benders cuts because validity comes from monotonicity and structural reasoning rather than dual multipliers (Forbes et al., 2021).

Scheduling applications have also produced neighborhood cuts. In unrelated-machine scheduling with sequence-dependent and resource-constrained setups, a local branching inequality can be used as a single logic-based Benders cut that removes an entire $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$3-OPT neighborhood after exhaustive exploration of that neighborhood in the subproblem. The resulting cut excludes all schedules in that neighborhood at once, rather than one incumbent schedule at a time (Avgerinos et al., 2023).

4. Strengthened, unified, disjunctive, and corner cuts

A substantial part of the modern literature is concerned with strengthening Benders cuts. In classical decomposition this includes Pareto-optimal cuts. Magnanti–Wong cuts solve an auxiliary cut-generating LP anchored at the current master point and a core point in $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$4; Papadakos cuts modify that construction by dropping the anchoring equality and maximizing at the core point directly. These are distinct optimality cuts: feasibility cuts still require separate ray-based generation (Larsen et al., 8 Jul 2026).

Unified cuts instead work in an extended dual space $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$5 and generate inequalities of the form

$$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$6

If $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$7, the cut is a feasibility cut; if $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$8, it is an optimality cut. This common structure encompasses the Fischetti et al. cuts, Brandenberg–Stursberg cuts, Hosseini–Turner deepest cuts, Seo et al. closest cuts, and Glomb et al. OLS cuts. In the empirical comparison on standardized MCFNDP instances, the leading methods were those featuring the static Brandenberg–Stursberg cuts and the Hosseini–Turner $$\max_{\pi} \ \pi^\top (b-A\bar x)\quad \text{s.t.}\quad B^\top \pi \le d,\ \pi\in\Pi,$$9-deepest cuts (Larsen et al., 8 Jul 2026).

The strength of a cut can also be characterized polyhedrally. In network maintenance scheduling, when the subproblem is a max-flow LP, the arcs with positive dual variables form a cut-set, and cuts derived from simple cut-sets are Pareto-optimal. Non-simple cut-sets yield dominated cuts, because a smaller cut-set produces a uniformly tighter inequality for some feasible network states (Pearce et al., 2016).

Disjunctive Benders decomposition pushes strengthening further by targeting the convex hull of the Benders reformulation rather than the continuous relaxation alone. It introduces split disjunctions on the integer master variables, defines

$\pi^*$0

and separates cuts valid for $\pi^*$1 via a cut-generating linear program with $\pi^*$2-normalization. For mixed-binary linear programs, this yields a finite algorithm that does not require solving the master as a mixed-integer program (Fang et al., 4 Jun 2025).

A related recent idea is the corner Benders cut. Starting from an optimal basis of the subproblem polyhedron $\pi^*$3, one constructs a corner

$\pi^*$4

where $\pi^*$5 is the basic feasible solution and $\pi^*$6 is the set of basis rays. The epigraph of the induced value function has the conic form

$\pi^*$7

and facet-defining corner cuts are obtained through a reverse polar formulation and row generation. With a suitable corner chosen from a Lagrangian direction, the LP with corner cuts attains the same bound as the original LP over $\pi^*$8, and in a Dantzig–Wolfe setting this recovers the DW bound in the projected $\pi^*$9-space (Ota et al., 26 Sep 2025).

5. Cut management, selection, and aggregation

The effectiveness of Benders decomposition is often determined less by the existence of valid cuts than by how many are added and when. In scenario-based affine potential-flow problems with topology switching and robustness scenarios, each iteration can produce up to $\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$0 cuts, one per scenario. Because many scenarios differ by only a few outaged arcs, the resulting cuts often have very similar coefficient vectors, and master growth rather than subproblem time becomes the bottleneck (Donkiewicz et al., 28 Apr 2026).

Several filtering strategies have therefore been proposed. Violation-based filtering keeps the cuts with largest

$\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$1

Diversity-based filtering clusters candidate cuts by cosine distance

$\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$2

using $\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$3-medoids and selecting one representative per cluster. A hybrid strategy applies clustering and then keeps, in each cluster, the most violated cut. Each strategy can optionally add an aggregated cut

$\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$4

which preserves part of the information from discarded cuts (Donkiewicz et al., 28 Apr 2026).

On 149 instances of that flow problem, all informed filtering strategies solved at least 125 instances, versus 91 for the unfiltered baseline, while reducing shifted geometric mean solve time by $\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$5–$\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$6. The best geometric mean was attained by the hybrid strategy, $\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$7 s versus $\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$8 s for the baseline, with $\theta \ge \pi^{*\top}(b-Ax)=\alpha+\beta^\top x.$9. Filtering reduced the geometric mean number of cuts per iteration from about 106 to about 10–11, while increasing iterations only moderately (Donkiewicz et al., 28 Apr 2026).

A different management mechanism is adaptive aggregation by scenario partitions. In the Benders adaptive-cuts method for two-stage stochastic linear programs, scenarios are grouped into a partition $\bar\pi$0, and one adds aggregated cuts

$\bar\pi$1

The partition is then refined using dual information until sufficient conditions ensure that the aggregated model is exact. This interpolates between single-cut and multi-cut Benders: early iterations benefit from a smaller master, while refinement restores multi-cut strength where needed (Ramírez-Pico et al., 2022).

These developments underline a second misconception: adding all available cuts is not always computationally preferable. In several settings, fewer but better chosen cuts improve total runtime, even when the number of Benders iterations increases (Donkiewicz et al., 28 Apr 2026).

6. Applications, empirical behavior, and limitations

Benders cuts now appear in a wide range of large-scale models. In the $\bar\pi$2-median problem, a branch-and-Benders-cut implementation based on a distance-ordered formulation derives client-wise cuts that can be separated in polynomial time, $\bar\pi$3, and yields a new compact formulation. The resulting algorithm outperformed state-of-the-art methods on benchmark instances by an order of magnitude (Mateluna et al., 2021).

In probabilistic set covering, the subproblems are pure feasibility LPs, so only feasibility cuts are needed. The cuts can be separated in polynomial time, strengthened by initial cuts at $\bar\pi$4 and by mixed-integer rounding, and the resulting algorithm solved instances with up to 500 rows, 5000 columns, and 2000 scenarios (Liang et al., 24 Jan 2025).

In stochastic planning-and-scheduling, logic-based Benders decomposition with CP subproblems was computationally superior to the integer L-shaped method, and a branch-and-check variant was faster by several orders of magnitude, allowing significantly larger instances to be solved (Elci et al., 2020). In stochastic resource allocation with simulation-based subproblems, logic-based cuts yielded exact sample-average solutions with up to 100 scenarios (Forbes et al., 2021). In distributed operating room scheduling, LBBD optimality cuts and BDD-based Benders cuts improved computational efficiency in a stochastic scheduling context (Guo et al., 2019).

In power and network applications, the role of cuts is equally central. For BESS siting and sizing in meshed transmission networks, Generalized Benders Decomposition with SOCP subproblems uses both optimality and feasibility cuts to steer capacity installation toward congestion management and voltage support, while preserving finite convergence of the decomposition for the MISOCP relaxation (Larroux et al., 4 Mar 2026). In large-scale network maintenance scheduling, disaggregated Benders cuts with lazy constraints proved optimality in many instances that had not previously been proven (Pearce et al., 2016). In vehicle routing with stochastic demands, corner Benders cuts recovered the strength of a Dantzig–Wolfe bound through multiple cuts in the projected space and improved a state-of-the-art algorithm (Ota et al., 26 Sep 2025).

The empirical record also shows limits. In the MCFNDP benchmark, although the best Benders methods were those using static Brandenberg–Stursberg and Hosseini–Turner $\bar\pi$5-deepest cuts, direct branch-and-cut on the full formulation was still fastest overall on many instances (Larsen et al., 8 Jul 2026). In the affine potential-based flow setting, the 5% cut-retention parameter was selected by validation and is explicitly instance-class specific (Donkiewicz et al., 28 Apr 2026). In adaptive stochastic decomposition, exactness depends on partition refinement conditions expressed in terms of scenario dual solutions (Ramírez-Pico et al., 2022). In short, stronger cuts do not automatically imply faster computation: cut quality, normalization, solver interaction, numerical stability, and master growth all matter.

Benders cuts therefore occupy a dual role. They are, first, the formal mechanism by which master and subproblem communicate feasibility and recourse cost. They are, second, the principal design lever for algorithmic performance. Classical dual cuts, logic-based cuts, unified cuts, disjunctive cuts, corner cuts, filtered cuts, and aggregated cuts all instantiate the same foundational idea, but they do so with markedly different geometric targets, computational overheads, and empirical trade-offs.