A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints

In this paper, a robust algorithm is proposed for globally solving a nonconvex quadratic programming problem (P1) with several additional multiplicative constraints. To our knowledge, little progress has been made so far for globally solving problem (P1). The proposed algorithm is based on a robust solution approach that provides an essential εε-optimal solution. This solution is also stable under small perturbations of the constraints, and it turns out that such a robust optimal solution is adequately guaranteed to be feasible and to be close to the actual optimal solution. Convergence of the algorithm is shown and three solved sample problems are given to illustrate the robust stability and feasibility of the present algorithm.