On symmetric duality in mathematical programming with F-convexity

Abstract

Under F-Convexity F-Concavity F-Pseudoconvexity F-Pseudoconcavity, appropriate duality results for pair of Wolfe and Mond-Weir type symmetric dual non linear programming problems are established. These duality results are then used to investigate duality for minimax versions of symmetric dual models wherein some of the primal and dual variables are constrained to belong to some arbitrary sets. e.g., the sets of integers.

Keywords:

• Symmetric Duallty
• Minimax
• Integer Programming
• F-Convexity