Unit Commitment Using Lagrangian Relaxation Method

This program employs the Lagrangian Relaxation method to solve the Unit Commitment (UC) problem. The UC problem involves determining which specific generating units to commit from a available set, while satisfying demand requirements and minimizing operational costs. The implementation uses a three-node test case consisting of start node, intermediate node, and end node configurations. This test case demonstrates the program's capability to handle constrained optimization problems, providing a practical framework for understanding Lagrangian Relaxation applications in power system scheduling. The core algorithm relaxes complicated constraints (such as minimum up/down times and ramp rates) into the objective function using Lagrange multipliers, then solves the resulting dual problem iteratively through subgradient optimization. Key functions include constraint handling, cost minimization, and iterative multiplier updates to achieve convergence toward optimal unit commitment decisions.