Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 107 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 436 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Scalable Multi-Level Optimization for Sequentially Cleared Energy Markets with a Case Study on Gas and Carbon Aware Unit Commitment (2502.13643v2)

Published 19 Feb 2025 in math.OC

Abstract: This paper examines Mixed-Integer Multi-Level problems with Sequential Followers (MIMLSF), a specialized optimization model aimed at enhancing upper-level decision-making by incorporating anticipated outcomes from lower-level sequential market-clearing processes. We introduce a novel approach that combines lexicographic optimization with a weighted-sum method to asymptotically approximate the MIMLSF as a single-level problem, capable of managing multi-level problems exceeding three levels. To enhance computational efficiency and scalability, we propose a dedicated Benders decomposition method with multi-level subproblem separability. To demonstrate the practical application of our MIMLSF solution technique, we tackle a unit commitment problem (UC) within an integrated electricity, gas, and carbon market clearing framework in the Northeastern United States, enabling the incorporation of anticipated costs and revenues from gas and carbon markets into UC decisions. This ensures that only profitable gas-fired power plants (GFPPs) are committed, allowing system operators to make informed decisions that prevent GFPP economic losses and reduce total operational costs under stressed electricity and gas systems. The case study not only demonstrates the applicability of the MIMLSF model but also highlights the computational benefits of the dedicated Benders decomposition technique, achieving average reductions of 32.23% in computing time and 94.23% in optimality gaps compared to state-of-the-art methods.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.