Mixed type second-order duality for a nondifferentiable continuous programming problem
By using suitable generalized second-order invexity assumptions, the authors establish weak, strong and converse duality theorems for a mixed type second-order duals to a nondifferentiable continuous programming problem studied by \textit{S. Chandra} et al. [J. Math. Anal. Appl. 107, 122--131 (1985; Zbl 0588.90078)], together with some special cases.
scientific article; zbMATH DE number 6367772