Finding Efficient Points in Multiobjective Quadratic Programming with Strictly Convex Objective Functions

In this work we consider the unconstrained multiobjective quadratic problem with strictly convex objective functions, (PCM — D). Firstly we expose a technique to determine the equations of the efficient points supposing that there are only two objective functions. This method is based on results on quadratic forms withdrawals by Gantmacher. Secondly, the technique explained is extended to calculate the equations of the efficient points of the general problem (PCM — D).