Applications of ellipsoidal approximations to polyhedral sets in power system optimization

被引：21

作者：

Saric, Andrija T. ^{[1
,2
]}

Stankovic, Aleksandar M. ^{[1
]}

机构：

[1] Northeastern Univ, Coll Engn, Boston, MA 02115 USA

[2] Univ Kragujevac, Eaeak Coll Engn, Kragujevac, Serbia

来源：

IEEE TRANSACTIONS ON POWER SYSTEMS | 2008年 / 23卷 / 03期

基金：

美国国家科学基金会;

关键词：

load dispatching; optimization methods; power generation dispatch; power system security;

D O I：

10.1109/TPWRS.2008.926435

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The paper presents a computational method that approximates feasible sets specified by linear or convex inequalities. This numerically efficient approach to power system optimization is based on computational geometry of multidimensional ellipsoids and is potentially applicable to problems with high dimensions, as it builds on recent advances in convex optimization. In an important application, it provides ranges in which nodal (generator) injections can vary without violating operational constraints in security analysis. The model is applied to two important problems in deregulated power systems: optimal economic dispatch (OED) and calculation of locational marginal prices (LMPs) in a day-ahead power market. Optimization problem with convex (ellipsoid-based) constraints is solved by a linear matrix inequality (LMI)-based procedure. The method is verified on the benchmark example with 68 buses, 16 generators, and 86 lines.

引用

页码：956 / 965

页数：10

共 25 条

[1] THE ELLIPSOIDAL TECHNIQUE FOR DESIGN CENTERING AND REGION APPROXIMATION [J].