OPTIMALITY CONDITIONS AND DUALITY FOR A CLASS OF NONDIFFERENTIABLE MULTIOBJECTIVE PROGRAMMING PROBLEMS

Abstract

In this paper, we formulate a general dual problem for a class of nondifferentiable multiobjective programs involving the support function of a compact convex set and linear functions. Fritz John and Kuhn-Tucker optimality conditions are presented. In addition, we establish weak and strong duality theorems for weakly efficient solutions under suitable generalized $(F,\alpha, \rho, d)$ convexity assumptions. Some special cases of our duality results are given.