Lab Home | Phone | Search | ||||||||
|
||||||||
In this work, we develop a mixed-integer quadratically constrained quadratic programming (MIQCQP) problem that minimizes total installation and operation cost of a remote off-grid microgrid by considering N-1 contingencies. It is well-known that this is an NP-hard network design problem. We make detailed comparisons of various QC relaxations and develop efficient decomposition algorithms for its solution. The off-grid microgrid is designed considering various devices that use renewable and non-renewable energy sources. We also model the nonlinear efficiency curves associated with these devices using a piecewise linear approximation. The efficiency of proposed relaxation and decomposition methods are demonstrated using the IEEE 13 node test feeder. Host: Chris Neale |