Unit commitment with ramp multipliers Export

@article{citeulike:788781, abstract = {This paper presents a new decomposition method, based on the Lagrangian relaxation technique, for solving the unit commitment problem with ramp rate constraints. By introducing an additional vector of multipliers to represent the cost of \“system ramping demand\”, this method can handle the coupling constraints between time periods while still keeping the simplicity of the original decomposition method. A new algorithm for updating multipliers is also proposed. Similar to the bundle algorithm, this algorithm maintains the previous iteration history to approximate the dual envelope. Unlike the bundle algorithm, this new algorithm generates an update step along the subgradient direction without any quadratic programming (QP) code. The new algorithm combines the bundle algorithm's smooth approach to the dual optimum with the sub-gradient method's fast update}, author = {Lai, Shih-Yih and Baldick, R.}, citeulike-article-id = {788781}, citeulike-linkout-0 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=744484}, journal = {Power Systems, IEEE Transactions on}, keywords = {bundle-methods, energy, lagrangian-relaxation, new, unit-commitment}, number = {1}, pages = {58--64}, posted-at = {2006-08-07 14:50:39}, priority = {2}, title = {Unit commitment with ramp multipliers}, url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=744484}, volume = {14}, year = {1999} }

TY - JOUR ID - citeulike:788781 L3 - citeulike-article-id:788781 N2 - This paper presents a new decomposition method, based on the Lagrangian relaxation technique, for solving the unit commitment problem with ramp rate constraints. By introducing an additional vector of multipliers to represent the cost of “system ramping demand”, this method can handle the coupling constraints between time periods while still keeping the simplicity of the original decomposition method. A new algorithm for updating multipliers is also proposed. Similar to the bundle algorithm, this algorithm maintains the previous iteration history to approximate the dual envelope. Unlike the bundle algorithm, this new algorithm generates an update step along the subgradient direction without any quadratic programming (QP) code. The new algorithm combines the bundle algorithm's smooth approach to the dual optimum with the sub-gradient method's fast update IS - 1 JF - Power Systems, IEEE Transactions on EP - 64 TI - Unit commitment with ramp multipliers VL - 14 SP - 58 KW - bundle-methods KW - energy KW - lagrangian-relaxation KW - new KW - unit-commitment AU - Lai, Shih-Yih AU - Baldick, R PY - 1999/// UR - http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=744484 ER -