ε-Pareto optimality conditions for convex multiobjective programming via max function

We consider a nondifferentiable convex multiobjective optimization problem whose feasible set is defined by affine equality constraints, convex inequality constraints, and an abstract convex set constraint. We obtain Fritz John and Kuhn-Tucker necessary and sufficient conditions for epsilon-Pareto optimality via a max function. We also provide some relations among epsilon-Pareto solutions for such a problem and approximate solutions for several associated scalar problems.