Unit Commitment Problem

Implemented an efficient MILP formulation that considers network restrictions (without assuming demand aggregation) and limitations imposed by the generators such as minimum up/down and ramping constraints.
Tested the model on real-world instances with up to 3375 buses.
Designed and implementing a decomposition algorithm that aims to speed up solution time on a modified formulation by using column generation and dynamic programming.