Pareto Optimal Solution Analysis of Multi Objective Quadratic Programming Problem

Multi Objective optimization is nowadays a word of order in engineering projects and many more sectors. A Pareto outcome is an action that harms no one and helps at least one. The aim of this paper is to define a solution concept of Pareto optimality for a Multi Objective Quadratic Programming Problem (MOQPP) and design two methods to extract Pareto optimal solution of MOQPP. In this paper, the methods of norm ideal point and membership function are used to solve the MOQPP which are effective in getting Pareto optimal solution.