Differentiable Multiobjective Fractional Minimax Programming Duality under Vectorη -Convex Functions

Abstract

In this paper we introduce the concepts of Differentiable multiobjective fractional

Minimax Programming Duality under vector η -convex functions. We establish necessary and sufficient optimality condition and weak duality theorem, strong duality theorem. To develop concept like Duality for multi objective fractional minimax programming problem. To develop some theorems and methods to solve multi objective fractional minimax under vector η -convexity and there by derive duality results for certain generalized multi objective fractional programming problems. To define Vector η -quasi convex and Vector η – Pseudo convex. We establish sufficient optimality condition under vector η – pseudo convexity.