ABSTRACT
Nonsmooth phenomena occur naturally and frequently in optimization theory. Therefore, the study of nondifferentiable mathematical programming by employing generalized directional derivatives and subdifferentials has been a field of intense investigation during the past several decades. Optimality conditions and duality theorems for nonsmooth multiobjective optimization problems have been an interesting research area. Kanniappan [124] obatained Fritz John and Karush-Kuhn-Tucker type necessary optimality conditions for a nondifferentiable convex multiobjective optimization problem by reducing it to a system of scalar minimization problems. Several scholars have developed interesting results by using generalized convex functions and subdifferentials. See for example, Craven [51], Bhatia and Jain [25], Kim and Bae [141], Liu [165], and the references therein. Duality for nonsmooth multiobjective fractional programming problems involving generalized convex functions have been studied by Kim [140], Kuk [152], Kuk et al. [153], Stancu-Minasian et al. [260], Nobakhtian [216], and Mishra and Upadhyay [197, 198].
