pith. sign in

arxiv: 2606.12707 · v1 · pith:ZDNZ4NQOnew · submitted 2026-06-10 · 📡 eess.SY · cs.SY· math.PR

Storage and Transport Capacity Design for a Self-Reliable Two-Node Stochastic Resource System

classification 📡 eess.SY cs.SYmath.PR
keywords transportstorageresourcecapacityfinitehorizonnodeoperating
0
0 comments X
read the original abstract

We study a two-node stochastic resource system operating over a finite horizon. Each node experiences uncertain supply and demand and is equipped with finite storage. The objective is to ensure that resource levels remain within prescribed limits with high probability. To this end, we formulate a chance-constrained capacity-design problem in which resources can be exchanged through a capacity-limited transport link. We characterize the minimum storage required at each node, derive the optimal transport policy, and quantify the trade-off between storage and transport capacities. Our results show the existence of a critical transport-capacity threshold that enables full risk pooling between the nodes. Moreover, this threshold decreases with the operating horizon, implying that full-pooling performance can be achieved with progressively smaller transport capacity over longer horizons.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.