An Efficient Approach for obtaining Feasible solutions from SOCP formulation of ACOPF.
Anamika TiwariAbheejeet MohapatraSoumya Ranjan SahooPublished in: CoRR (2019)
Keyphrases
- feasible solution
- linear programming
- second order cone program
- mixed integer
- mixed integer program
- valid inequalities
- linear programming relaxation
- mixed integer linear program
- lp relaxation
- tabu search
- objective function
- linear program
- optimal solution
- solution quality
- mathematical model
- quadratic programming
- primal dual
- solution space
- convex hull
- semidefinite programming
- quadratic program
- mixed integer programming
- globally optimal
- extreme points
- mixed integer linear programming
- lagrangian relaxation
- convex relaxation
- interior point methods
- convex optimization
- np hard
- network design problem
- cutting plane
- integer programming
- neural network
- column generation
- facility location
- search algorithm
- simulated annealing
- integer program
- integer solution
- dynamic programming
- special case