Parametric Duality Models for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-Invex Functions

A semi-infinite programming problem is a mathematical programming problem with a finite number of variables and infinitely many constraints. Duality theories and generalized convexity concepts are important research topics in mathematical programming. In this paper, we discuss a fairly large number of paramet- ric duality results under various generalized （η,ρ）-invexity assumptions for a semi-infinite minmax fractional programming problem.     

Global Parametric Sufficient Efficiency Conditions for Semiinfinite Multiobjective Fractional Programming Problems Containing Generalized （a,n,p）-V-Invex Functions

In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized (α, η, ρ)-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.     

Nondifferentiable Multiobjective Programming under Generalized d-ρ-(η,θ)-Type I Univexity

In this paper,on the basis of notions of d-ρ-(η,θ)-invex function,type I function and univex function,we present new classes of generalized d-ρ-(η,θ)-type I univex functions.By using these new concepts,we obtain several sufficient optimality conditions for a feasible solution to be an efficient solution,and derive some Mond-Weir type duality results.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Nonparametric Duality Models for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions

In this paper, we discuss a fairly large number of nonparametric duality results under various generalized (η, ρ)-invexity assumptions for a semi-infinite minmax fractional programming problem.     

Semiparametric Sufficient Efficiency Conditions and Duality Models for Multiobjective Fractional Subset Programming Problems with Generalized (Ф, ρ, θ)-Convex Functions

In this paper, we present a multitude of global semiparametric sufficient efficiency and duality results under generalized (, , )-convexity assumptions for a multiobjective fractional subset programming problem.