Hybrid scalarization technique for solving multiobjectivequadratically constrained quadratic programming

In this paper, the Hybrid scalarization technique is exploited for solving multiobjectivequadratically constrained quadratic programming problems with (non)convexquadratic function. To this end, a linear programming relaxation is derived thatcomputes a lower bound on the optimal objective value of the scalarization problem.Basically, the proposed algorithm aims to find efficient solutions to the problem bysolving the linear relaxation sequentially on the subsets of the feasible region.

Keywords:

Multiobjective programming , quadratic programming , Linear relaxation , Convex and concave envelopes.