Solving Definite Quadratic Bi-Objective Programming Problems by KKT Conditions

A bi-objective programming has been proposed for dealing with decision process involving two decision makers. In this paper, a bi-objective programming problem in which both objective functions are definite quadratic is considered. The feasible region is assumed to be a convex polyhedron. Solution methods namely; using KKT Conditions is developed. Illustrative examples for the method are presented and theorems and facts to support the method are also discussed. The solution of the examples are obtained using a LINGO (15.0) mathematical software.