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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call