Learn More
We consider the problem of designing (or augmenting) an electric power system such that it satisfies the N-k-ε survivability criterion while minimizing total cost. The survivability criterion requires that at least (1− ε) 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(More)
We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an N-k-ε reliability criterion. This reliability criterion is a generalization of the wellknown N-k criterion, and dictates that at least (1−ε j) fraction of the total system demand must be met following(More)
In this paper, we propose several integer programming (IP) formulations to exactly solve the minimum-cost λ -edge-connected k-subgraph problem, or the (k,λ )-subgraph problem, based on its graph properties. Special cases of this problem include the well-known k-minimum spanning tree problem (if λ = 1), λ -edgeconnected spanning subgraph problem (if k = |V(More)
Robust chance-constrained Support VectorMachines (SVM)with secondorder moment information can be reformulated into equivalent and tractable Semidefinite Programming (SDP) and Second Order Cone Programming (SOCP) models. However, practical applications involve processing large-scale data sets. For the reformulated SDP and SOCPmodels, existed solvers by(More)