On second-order symmetric duality in nondifferentiable programming (Q5934249): Difference between revisions

This is paper is devoted to a new pair of second-order symmetric dual non-differentiable programs by establishing the weak and the strong duality results, under a new concept of second-order \(F\)-pseudo-convexity assumption. Some special cases by choosing particular forms of the sublinear functional \(F\) are presented at the end of this work.