Optimal Iterative Method for Network Utility Maximization with Intertemporal Constraints
Network utility maximization (NUM) has been widely used to solve the optimal resource allocation problem in wireless network and power systems. The network planner aims to allocate generation and demand over producers and consumers such that social welfare is maximized while supply and demand are balanced, and network constraints such as branch capacity constraints are satisfied. However, when taking into account dynamics of agents, such as ramp rate constraints on power output for suppliers and impact of cumulative prior consumption on current demand for consumers, a single-period formulation is not sufficient. We propose an iterative method for the multi-period NUM with intertemporal constraints based on dual decomposition. It features a price iteration scheme that achieves optimal social welfare, and the algorithm is guaranteed to converge if proper concavity condition holds. We illustrate the iterative algorithm by power system examples. It is shown that similar to locational marginal price (LMP) in power systems, time-varying congestion prices arise when there exists binding branch constraints. Simulation results also demonstrate that there is increase in social welfare compared to a single-period formulation.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1592699
- Report Number(s):
- PNNL-SA-138370
- Resource Relation:
- Conference: 3rd IEEE Conference on Control Technology and Applications (CCTA 2019), August 19-21, 2019, Hong Kong, China
- Country of Publication:
- United States
- Language:
- English
Similar Records
Transactive Coordination of Flexible Loads with Energy Storage through Day-ahead Scheduling
Implications of dynamic demand functions for public utility pricing and regulatory policy