Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling

Abstract

AbstractIn this paper, we consider a polynomial problem with equilibrium constraints in which the constraint functions and the equilibrium constraints involve data uncertainties. Employing a robust optimization approach, we examine the uncertain equilibrium constrained polynomial optimization problem by establishing lower bound approximations and asymptotic convergences of bounded degree diagonally dominant sum-of-squares (DSOS), scaled diagonally dominant sum-of-squares (SDSOS) and sum-of-squares (SOS) polynomial relaxations for the robust equilibrium constrained polynomial optimization problem. We also provide numerical examples to illustrate how the optimal value of a robust equilibrium constrained problem can be calculated by solving associated relaxation problems. Furthermore, an application to electric vehicle charging scheduling problems under uncertain discharging supplies shows that for the lower relaxation degrees, the DSOS, SDSOS and SOS relaxations obtain reasonable charging costs and for the higher relaxation degrees, the SDSOS relaxation scheme has the best performance, making it desirable for practical applications.