Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

N-k-e Survivable Power System Design (1201.1530v1)

Published 7 Jan 2012 in math.OC and cs.DS

Abstract: We consider the problem of designing (or augmenting) an electric power system such that it satisfies the N-k-e survivability criterion while minimizing total cost. The survivability criterion requires that at least (1-e) fraction of the total demand can still be met even if any k (or fewer) of the system components fail. We formulate this problem, taking into account both transmission and generation expansion planning, as a mixed-integer program. Two algorithms are designed and tested on modified instances from the IEEE-30-Bus and IEEE- 57-Bus systems.

Citations (4)

Summary

We haven't generated a summary for this paper yet.