Abstract
This paper discusses battery storage formulations and analyzes the impact of the constraints on the computational performance of security constrained unit commitment (SCUC). Binary variables are in general required due to mutual exclusiveness of charging and discharging modes. We use valid inequalities to improve the SOC constraints. Adding batteries to the MISO day ahead market clearing cases reveals the impact of binary variables and the valid inequalities on SCUC solving time. Warm start and lazy constraint techniques are applied to improve the performance and make the valid inequalities more effective, reducing computation time to acceptable levels for implementation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
