Non-differentiable second-order mixed symmetric duality with cone constraints

Abstract

A pair of mixed non-differentiable second-order symmetric dual programmesover cones is considered. Weak, strong and converse duality theorems are establishedunder second-order (F, ) convexity/pseudo-convexity assumptions. Special cases arealso discussed to show that this paper extends some known results in the literature.

Keywords

• symmetric duality
• mixed second-order duality
• second-order (F
•  ) convexity/pseudo-convexity
• non-differentiable programming
• cone constraints