Minimax Non-differentiable Multiobjective Fractional Programming with Generalized (F, Ρ) – Convexity

Abstract

In this paper we introduce necessary and sufficient conditions for non-differentiable minimax fractional problem with generalized convexity and applied these optimality conditions to construct one parametric dual model and also discussed duality theorems. We obtained duality theorems for two parameters-free models of a nondifferentiable minimax fractional programming problem, involving generalized convexity assumptions. we established sufficient optimality conditions and duality theorems for nondiffertiable minimax fractional programming problem under (F, α, Ï, d) convexity assumptions. we discussed the optimality conditions and duality results for nondifferentiable minimax fractional programming under α-univexity.