Non-differentiable multiobjective mixed symmetric duality under generalized convexity

Abstract

Abstract The objective of this paper is to obtain a mixed symmetric dual model for a class of non-differentiable multiobjective nonlinear programming problems where each of the objective functions contains a pair of support functions. Weak, strong and converse duality theorems are established for the model under some suitable assumptions of generalized convexity. Several special cases are also obtained. MS Classification: 90C32; 90C46.

Keywords

• symmetric duality
• non-differentiable nonlinear programming
• generalized convexity
• support function