Mitiku, Semu (PhD)Kidane, Tsega2018-07-192023-11-042018-07-192023-11-042014-06-30http://etd.aau.edu.et/handle/123456789/9342In this project we see about the duality in multiobjective programming. We investigate a general convex multiobjective optimization problem with cone inequality constraints. The main idea of constructing the multiobjective dual problem is to establish frst a dual problem to the scalarized primal. In addition to these the project also explains some points about multiobjective optimization problem and conjugate duality for scalar optimization problems. Keywords: Lagrange dual function, Conjugate function, Conjugate map, Dual cone, Multiobjective OptimizationenLagrange dual functionConjugate functionConjugate mapDual coneMultiobjective OptimizationThesis