Spatiotemporal secure feasible region construction for multiple VPPs’ joint offering

As new market entities, Virtual Power Plants (VPPs) face numerous challenges when participating in wholesale electricity markets, such as the capacity threshold requirements set by market rules and the security risks associated with integrating VPPs into distribution networks. To address these challenges, this paper proposes a joint offering approach for multiple VPPs. To support this multi-VPP joint offering, we develop a method to construct an active power feasible region for multiple VPPs, ensuring achievable power trajectories meet market and network requirements under temporal and spatial coupling constraints. For temporal coupling, we employ robust optimization with a nested Column-and-Constraint Generation (C&CG) algorithm to solve for single VPP feasible envelopes under wind power uncertainty. For spatial coupling, we use a discretization sampling method combined with the Qhull algorithm to construct secure network-constrained feasible polytopes for the VPP alliance. Case studies indicate that key factors, including wind power uncertainty and grid-connected location of VPPs, significantly affect the feasible region. The proposed method can ensure secure bidding strategies for VPPs in electricity markets.