Approximation of feasible sets in energy system applications via convex optimization

被引:0
|
作者
Sari, Andrija T. [1 ]
Stankovic, Aleksandar M. [1 ]
机构
[1] Northeastern Univ, Coll Engn, Boston, MA 02115 USA
基金
美国国家科学基金会;
关键词
feasible set; approximation methods; convex optimization; power generation dispatch; power system security;
D O I
10.1109/PSCE.2006.296155
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
In this paper we present and compare two interior point methods for ellipsoidal approximations of feasible sets defined by linear inequalities. The two procedures (primal-dual maximum volume MaxVE and a linear matrix inequality-based method LMI) are compared on a Simultaneous Feasibility Test (SFT) in power system contingency analysis. The methods simultaneously determine optimal analytic center of the approximating ellipsoid, and its shape matrix for maximal volume inner approximation. The methods are potentially useful optimization in deregulated power markets, for example Security-Constrained Economic Dispatch (SCED). The applicability of the two methods is demonstrated on two characteristic test examples: 1) small-size with 6 buses and 3 generators, where visual representation of feasible region are possible, and 2) medium-size with 68 buses and 16 generators.
引用
收藏
页码:1619 / +
页数:4
相关论文
共 50 条