Improved weighted sum method for solving multiobjectivequadratically constrained quadratic programming

Most of existing methods solving multiobjective quadratic programming with convexfunctions and linear constraints. In this paper, the improved weighted sum method is usedto solve this problem with both convex and nonconvex quadratic functions. An algorithm isproposed, which converges to a set of efficient solutions.