Convex Relaxation of Combined Heat and Power Dispatch
Yibao Jiang, Can Wan, Audun Botterud, Yonghua Song, Mohammad, Shahidehpour

TL;DR
This paper introduces a convex optimization approach for combined heat and power dispatch that enhances solution quality and computational efficiency by relaxing nonlinear constraints and employing an adaptive solution algorithm.
Contribution
It presents a novel convex model for combined heat and power dispatch that avoids simplifying assumptions and improves solution accuracy through relaxation and dynamic partitioning.
Findings
The proposed method outperforms traditional nonlinear programming solutions.
Convex relaxations significantly improve computational efficiency.
Adaptive algorithm reduces relaxation gaps effectively.
Abstract
Combined heat and power dispatch promotes interactions and synergies between electric power systems and district heating systems. However, nonlinear and nonconvex heating flow imposes significant challenges on finding qualified solutions efficiently. Most existing methods rely on constant flow assumptions to derive a linear heating flow model, sacrificing optimality for computational simplicity. This paper proposes a novel convex combined heat and power dispatch model based on model simplification and constraint relaxation, which improves solution quality and avoids assumptions on operating regimes of district heating systems. To alleviate mathematical complexity introduced by the commonly used node method, a simplified thermal dynamic model is proposed to capture temperature changes in networked pipelines. Conic and polyhedral relaxations are then applied to convexify the original…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
