Multiobjective Quadratic Problem: Characterization of the Efficient Points

Here we consider the multiobjective quadratic problem with convex objective functions: (MQP) $$ \begin{array}{*{20}{c}} {Min\left( {{f_1}\left( x \right), \ldots ,{f_m}\left( x \right)} \right)} \\ {x \in \mathbb{R}} \end{array} $$ (1) where ƒ i (x)=1/2 x t A i x+b i t x, i = 1,…,m are convex functions, x,b i ∈ ℝ n , and A i ∈ M n×n