Generalised convexity and symmetric duality in nonlinear programming

On Converse Duality for Nonsmooth Optimization Problem

“…Recently, the invexity conception has been extended to the non differentiable cases by many authors [5,6,7]. In particular, Reiland [6J defined the nonsmooth invexity of Lipschitz functions and obtained the generalized Kuhn-Tucker sufficient optimality criteria, the weak duality and the strong duality for a nonlinear optimization problem (PI involving nonsmooth invex Lipschitz functions .…”