Absolute Value Constraint based Method for Interval Optimization to SCED Model
This letter proposes an absolute value based method to solve the interval linear optimization problem with application to security constrained economic dispatch (SCED). To avoid expensive computation associated with solving combinatorial linear programming (LP) problems for interval upper bound, firstly a bilinear programming model is formulated using duality theory. The equality constraints are then converted to absolute value constraints. Lastly, the absolute value operator is eliminated through introducing two nonnegative slack variables and complementary slackness condition. The resulting new bilinear programming model can be effectively solved by the branch and bound method with linear relaxation technique to obtain the global optimal solution. Numerical results demonstrate the effectiveness of the proposed method in improving solution and computation time.
T. Ding et al., "Absolute Value Constraint based Method for Interval Optimization to SCED Model," IEEE Transactions on Power Systems, vol. 29, no. 2, pp. 980-981, Institute of Electrical and Electronics Engineers (IEEE), Mar 2014.
The definitive version is available at https://doi.org/10.1109/TPWRS.2013.2287998
Electrical and Computer Engineering
Keywords and Phrases
Absolute Values; Bilinear Programming; Complementary Slackness Condition; Interval Optimization; Security-Constrained Economic Dispatch; Linear Programming; Numerical Methods; Scheduling; Constrained Optimization; Absolute Value Constraint; Security Constrained Economic Dispatch (SCED)
International Standard Serial Number (ISSN)
Article - Journal
© 2014 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.