Zephyr, LucknyGuo, GeWang, ZongjieMorillo, Jose2021-12-242021-12-242022-01-04978-0-9981331-5-7http://hdl.handle.net/10125/79752We study a multi-period unit commitment problem under wind energy penetration, in which the load balance is enforced with a predefined confidence level across the whole system and over the planning horizon. Since, except for special cases, chance-constrained problems are non-convex, we analyze two relaxations of the load balance based upon robust optimization ideas and estimated quantiles of the marginal distributions of the net load processes. The approximation proposals are benchmarked against the well-known scenario approximation. Under the scenario approach, we also analyze a simple decomposition strategy to find a lower bound of the approximate problem, when the latter becomes intractable due the size of the set of scenarios. The reliability of the obtained solutions as well as their runtimes are examined on three widespread test systems.10 pagesengAttribution-NonCommercial-NoDerivatives 4.0 InternationalDistributed, Renewable, and Mobile Resourcesunit commitmentchance-constrained programmingrobust optimizationquantiletext10.24251/HICSS.2022.417