On Converse Duality for Nonsmooth Optimization Problem

Abstract

Recently, Reiland [6] defined the nonsmooth invexity of Lipschitz functions and obtained the generalized Kuhn-Tucker sufficient opt.imalify criterin, the weak duality and the st.rong duality for a l1on!ienar optimization problem (P) involving nonsmooth invex Lipschitz functions. The purpose of this brief paper, following JCYllkumllr's 141 approach, is to establish the converse duality for (P).

Nonsmooth ρ − (η, θ)-invexity in multiobjective programming problems

“…On the other hand, Nahak and Nanda [12], Lee and Kim [11] investigated the optimality conditions and the duality theorems for nonlinear multi-objective optimization problems involving differentiable invex functions.…”