New method for computing the upper bound of optimal value in interval quadratic program

We consider the interval quadratic programming problems. The aim of this paper is to present a new method to compute the upper bound of the optimal values, under weaker conditions. Moreover, we discuss the relations between the new method and previous results. The features of the proposed methods are illustrated by some examples.