Aggregate Flexibility Envelope

• Aggregate Flexibility Envelope is a mathematical framework that characterizes all feasible aggregate power or energy trajectories from distributed flexible devices under device-level and system constraints.
• It leverages convex analysis, polyhedral geometry, and robust optimization to construct vertex-based inner approximations that enable tractable, scalable, and implementable scheduling.
• The framework supports operational decisions such as cost and peak power minimization by ensuring any aggregate trajectory can be efficiently disaggregated into feasible device-level instructions.

An aggregate flexibility envelope is a mathematical construct that compactly characterizes the set of all feasible aggregate power or energy trajectories that can be delivered by an ensemble of flexible devices—such as batteries, thermostatically controlled loads (TCLs), or electric vehicles (EVs)—over a given time horizon, subject to device-level and system constraints. These envelopes are essential for system operators, aggregators, and markets to internalize and schedule distributed flexibility, while enabling guarantees that any schedule within the envelope can be disaggregated to feasible device-level instructions. The construction and utilization of flexibility envelopes are governed by convex analysis, polyhedral geometry, and robust optimization, and advanced recent work focuses on scalable, accurate representations and tractable optimization and disaggregation.

1. Exact Formulation of the Aggregate Flexibility Envelope

Let $N$ denote the number of flexible devices (e.g., batteries), each indexed by $i$. Over a discrete time horizon of $d$ periods, the feasible trajectories of device $i$ are described by a polytope $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$, where $x_i$ denotes the power profile and $(A_i, b_i)$ encode operational constraints such as power, energy, or state-of-charge limits.

The aggregate flexibility envelope $F_{\rm agg}$ is defined as the Minkowski sum of these polytopes: $$F_{\rm agg} = \sum_{i=1}^N F_i = \left\{ x = \sum_{i=1}^N x_i \mid x_i \in F_i \right\}$$ This set describes all aggregate power trajectories achievable by combining any feasible individual schedules. However, for general $N$ and $i$0, $i$1 is a high-dimensional polytope whose exact facet or vertex enumeration is computationally intractable (“curse of dimensionality”). This motivates the computation of tractable inner- or outer-approximations $i$2 with explicit disaggregation guarantees (Öztürk et al., 2023).

2. Vertex-Based Inner Approximation and the Envelope Construction

Öztürk et al. (Öztürk et al., 2023) propose an objective-agnostic inner-approximation based on extremal-vertex enumeration:

• For each device $i$3 and each sign pattern $i$4, construct a vertex candidate $i$5 by greedily maximizing along the coordinate directions:
  • $i$6

  • For $i$7,

    $i$8

• The vector of all $i$9 across $d$0 is summed to form an aggregate vertex: $d$1.
• Proposition III.4: Each $d$2 is a vertex of $d$3. The inner-approximation is defined as the convex hull:

  $d$4

• In practical computation, one may sample a subset $d$5 of sign patterns to trade off between accuracy and scalability.

The polytope $d$6 resides explicitly as a convex combination of the $d$7, and its description scales linearly in $d$8 and at most exponentially (in the worst case) in $d$9. For most applications, far fewer than $i$0 patterns suffice to recover the essential shape of the envelope.

3. Optimization over the Envelope and Accuracy Metrics

The constructed envelope $i$1 is intended to be used as an admissible proxy for the exact aggregate flexibility set in system-level optimization:

• Cost minimization: $i$2, with $i$3 as (e.g.) the price vector.
• Peak power minimization: $i$4.

The approximation quality is assessed via the Unused-Potential-Ratio (UPR), defined as: $i$5 where $i$6 is the achieved objective with $i$7, $i$8 is the true optimum with $i$9, and $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$0 is the unmanaged baseline (e.g., zero flexibility). UPR values closer to zero indicate a tight approximation (Öztürk et al., 2023).

4. Disaggregation and Implementability

A critical feature of the vertex-based envelope is the efficient disaggregation property:

• Given any aggregate profile $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$1 expressed as $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$2 (with $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$3), the individual device trajectories are recovered as:

  $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$4

• Each $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$5, and $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$6.
• This avoids the need for additional LP disaggregation and guarantees implementability for any aggregate trajectory within the envelope (Öztürk et al., 2023).

5. Computational Complexity and Benchmarking

The overall computational effort is governed by:

• Enumeration of $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$7 sign-patterns: $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$8 time.
• Convex hull operations: efficient as the set is supplied in vertex form, and convex optimization over $F_i = \{ x \in \mathbb{R}^d \mid A_i x \le b_i \}$9 can proceed by barycentric coordinates.
• In empirical studies, the vertex envelope approach outperformed ten state-of-the-art inner approximations—such as zonotope, ellipsoid, and homothet-based methods—in both computational complexity and accuracy (e.g., achieving UPRs below 8% for cost and peak minimization, vs. 30–100% for other techniques), and scaled to $x_i$0 in under 6 minutes (Öztürk et al., 2023).

Problem size	Vertex method time	UPR (cost)	Competing methods time	UPR (cost)
$x_i$1	$x_i$20.4 s	$x_i$38%	10–100s, or fail ($x_i$410 min)	30–100%
$x_i$5	$x_i$66 min	7–34%	—	—

6. Trade-offs, Scalability, and Broader Relevance

• The number of extreme points $x_i$7 can be tuned to balance accuracy against runtime, and $x_i$8 is empirically sufficient for high fidelity in most cases.
• The method generalizes straightforwardly to other classes of polytopic or convex flexibility sets, allowing for broader applicability including aggregations of TCLs, EVs, and mixed DERs.
• By representing the dominant vertices relevant for operational objectives, the aggregate envelope is immediately amenable to day-ahead scheduling, market participation, and real-time dispatch, while offering provable implementability via the disaggregation mapping (Öztürk et al., 2023).

7. Context Within the Literature and Extensions

The vertex-based envelope framework addresses classical computational barriers in Minkowski sum calculation by combining algorithmic tractability, inner-approximation guarantees, and efficient disaggregation:

• Contrasted with zonotopic, ellipsoidal, and homothet-based approaches, which may suffer from conservativeness or scalability issues, as detailed in benchmarking (Öztürk et al., 2023).
• The method unifies several strands of aggregate flexibility approximation, and connects with parallel advances in generalized polymatroid approaches, hyper-rectangular inner/outer bounds, and projection-based relaxations in the broader literature.
• Practical extensions include sampling-based refinement, hybridization with convex-projection and scenario methods for uncertainty handling, and incorporation into market interfaces and network-constrained aggregations.

Conclusion:

The aggregate flexibility envelope is a mathematically grounded, scalable, and operationally robust construct for quantifying and deploying the joint flexibility of distributed devices. The vertex-based convex hull approach introduced by Öztürk et al. establishes new best-in-class trade-offs between computational cost and accuracy, while guaranteeing that any profile in the envelope can be feasibly implemented at device level—making it an essential tool for modern aggregator, system operator, and market architectures (Öztürk et al., 2023).