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 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 conditions 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 (α, η, ρ)-V-Invex Functions

Abstract In this paper, we discuss numerous sets of global parametric sufficient efficiency conditions under various generalized （a,n, p）-V-invexity assumptions for a semiinfinite multiobjective fractional programming problem.